15778<>0_4<>jean-claude bajard:jean duprat:sylvanus kla<>some operators for on-line radix-2 computations<>jpdc<>jean-michel muller<>
15793<>0_19<>nulo<>some characterizations of functions computable in on-line arithmetic<>tc<>jean-michel muller<>
15798<>0_24<>marc daumas:jean vuillemin<>implementing on line arithmetic on pam<>fpl<>jean-michel muller<>
15799<>0_25<>jean-claude bajard:sylvanus kla<>bkm: a new hardware algorithm for complex elementary functions<>tc<>jean-michel muller<>
5938<>7_12<>john v. guttag:james j. horning:yang meng tan<>lclint: a tool for using specifications to check code<>sigsoft<>david evans<>
26554<>17_1<>nulo<>analysis of bounded disorder<>mfcs<>ricardo a. baeza-yates<>
26580<>17_27<>christian choffrut:gaston h. gonnet<>on boyer-moore automata<>algorithmica<>ricardo a. baeza-yates<>
26626<>17_73<>walter cunto:udi manber:sun wu<>proximity matching using fixed-queries trees<>cpm<>ricardo a. baeza-yates<>
26633<>17_80<>gaston h. gonnet<>fast string matching with mismatches<>iandc<>ricardo a. baeza-yates<>
23326<>18_15<>alon efrat<>a near-linear algorithm for the planar segment center problem<>soda<>micha sharir<>
23347<>18_36<>dan halperin<>almost tight upper bounds for the single cell and zone problems in three dimensions<>compgeom<>micha sharir<>
23352<>18_41<>bernard chazelle:herbert edelsbrunner:leonidas j. guibas:john hershberger:raimund seidel<>selecting heavily covered points<>siamcomp<>micha sharir<>
25065<>25_3<>micha sharir:sivan toledo<>applications of parametric searching in geometric optimization<>jal<>pankaj k. agarwal<>
25088<>25_26<>subhash suri<>surface approximation and geometric partitions<>soda<>pankaj k. agarwal<>
25106<>25_44<>micha sharir<>planar geometric location problems<>algorithmica<>pankaj k. agarwal<>
25155<>25_93<>matthew j. katz:micha sharir<>computing depth orders and related problems<>swat<>pankaj k. agarwal<>
25156<>25_94<>mark de berg:jiri matousek:otfried schwarzkopf<>constructing levels in arrangements and higher order voronoi diagrams<>compgeom<>pankaj k. agarwal<>
25173<>25_111<>noga alon:boris aronov:subhash suri<>can visibility graphs be represented compactly?<>dcg<>pankaj k. agarwal<>
25183<>25_121<>boris aronov:micha sharir<>computing envelopes in four dimensions with applications<>compgeom<>pankaj k. agarwal<>
8511<>26_8<>xiaofeng guo<>k-cycle resonant graphs<>dm<>fuji zhang<>
8512<>26_9<>xueliang li<>hamiltonicity of a type of interchange graphs<>dam<>fuji zhang<>
8500<>31_1<>erik h. d'hollander<>enhancing parallelism by removing cyclic data dependencies<>parle<>fubo zhang<>
33419<>32_10<>carolyn b. seaman<>opt: organization and process together<>ispw<>victor r. basili<>
5974<>42_1<>jeffrey horn:kalyanmoy deb<>long path problems<>ppsn<>david e. goldberg<>
5977<>42_4<>jeffrey horn<>genetic algorithm difficulty and the modality of fitness landscapes<>foga<>david e. goldberg<>
6015<>46_0<>jeffrey horn:nicholas nafpliotis<>a niched pareto genetic algorithm for multiobjective optimization<>icec<>david e. goldberg<>
26788<>49_0<>paola bertolazzi:giuseppe di battista:roberto tamassia:ioannis g. tollis<>how to draw a series-parallel digraph<>ijcga<>robert f. cohen<>
18757<>57_3<>chiaki sakama<>on positive occurrences of negation as failure<>kr<>katsumi inoue<>
18761<>57_7<>nulo<>hypothetical reasoning in logic programs<>jlp<>katsumi inoue<>
10864<>99_23<>paul w. a. stallard:david h. d. warren:sanjay raina<>parallel evaluation of a parallel architecture by means of calibrated emulation<>ipps<>henk l. muller<>
34525<>100_34<>teddy wu<>towards a declarative framework for hardware-software codesign<>codes<>wayne luk<>
23408<>106_14<>christine tomlinson<>workflow execution through distributed events<>comad<>munindar p. singh<>
23426<>106_32<>michael n. huhns<>automating workflows for service order processing: integrating ai and database technologies<>expert<>munindar p. singh<>
6599<>124_0<>kenneth rose<>a non-greedy approach to tree-structured clustering<>prl<>david j. miller<>
6564<>127_5<>joshua s. hodas<>logic programming in a fragment of intuitionistic linear logic<>iandc<>dale miller<>
6585<>127_26<>nulo<>a multiple-conclusion meta-logic<>lics<>dale miller<>
5737<>153_8<>marshall w. bern:john r. gilbert<>provably good mesh generation<>jcss<>david eppstein<>
5810<>153_81<>nulo<>tree-weighted neighbors and geometric k smallest spanning trees<>ijcga<>david eppstein<>
5813<>153_84<>boris aronov:marshall w. bern<>on the number of minimal 1-steiner trees<>dcg<>david eppstein<>
5814<>153_85<>nulo<>clustering for faster network simplex pivots<>soda<>david eppstein<>
5838<>153_109<>nulo<>finding the k shortest paths<>focs<>david eppstein<>
5844<>153_115<>nulo<>offline algorithms for dynamic minimum spanning tree problems<>jal<>david eppstein<>
5874<>153_145<>nulo<>approximating the minimum weight steiner triangulation<>dcg<>david eppstein<>
5895<>153_166<>nulo<>average case analysis of dynamic geometric optimization<>soda<>david eppstein<>
5902<>153_173<>jeff erickson<>iterated nearest neighbors and finding minimal polytopes<>dcg<>david eppstein<>
5910<>153_181<>nulo<>arboricity and bipartite subgraph listing algorithms<>ipl<>david eppstein<>
22320<>155_0<>soo-young lee:cheol hoon park<>a new neuro-fuzzy identification model of nonlinear dynamic systems<>ijar<>minho lee<>
17439<>157_1<>k. n. brown:chris a. mcmahon<>a formal language for the design of manufacturable objects<>ifip5-2<>j. h. sims williams<>
27153<>202_8<>bob henery:cao feng:a. sutherland<>"a comparative study of classification algorithms: statistical, machine learning and neural network."<>mi<>ross d. king<>
27156<>202_11<>dominic a. clark:jack shirazi:michael j. e. sternberg<>inductive logic programming used to discover topological constraints in protein structures<>ismb<>ross d. king<>
27166<>202_21<>michael j. e. sternberg:r. a. lewis:stephen muggleton<>machine learning and biomolecular modelling<>mi<>ross d. king<>
27170<>202_25<>jonathan d. hirst:michael j. e. sternberg<>quantitative structure-activity relationships by neural networks and inductive logic programming. ii. the inhibition of dihydrofolate reductase by triazines<>jcamd<>ross d. king<>
27172<>202_27<>jonathan d. hirst:michael j. e. sternberg<>quantitative structure-activity relationships by neural networks and inductive logic programming. i. the inhibition of dihydrofolate reductase by pyrimidines<>jcamd<>ross d. king<>
27176<>202_31<>ivan bratko<>applications of inductive logic programming<>sigart<>ross d. king<>
34729<>205_15<>zhenyuan wang<>extension of lower probabilities and coherence of belief measures<>ipmu<>wei wang<>
21521<>209_2<>shigeaki aoki:nobuo koizumi<>design and control of shared conferencing environments for audio telecommunication using individually measured hrtfs<>presence<>michael cohen<>
34813<>212_7<>barry joe:c. y. wang<>on the difference method for drawing conic arcs<>cvgip<>wenping wang<>
17203<>221_3<>hong-de chang<>a robust stroke extraction method for handwritten chinese characters<>ijprai<>jhing-fa wang<>
11886<>223_0<>m. karim moallemi<>a general numerical procedure for multilayer multistep ic process simulation<>tcad<>hui zhang<>
17176<>234_15<>steven homer<>immunity of complete problems<>iandc<>jie wang<>
39135<>245_4<>masaharu munetomo:yoshiaki takai<>a genetic approach to dynamic load balancing in a distributed computing system<>icec<>yoshiharu sato<>
30873<>269_40<>mahendra sekaran:john hale<>learning to coordinate without sharing information<>aaai<>sandip sen<>
30878<>269_45<>edmund h. durfee<>the role of commitment in cooperative negotiation<>ijcis<>sandip sen<>
30946<>270_36<>nulo<>"lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems."<>fsttcs<>sandeep sen<>
30951<>273_1<>nulo<>a tale of two representations<>ieaaie<>sandip sen<>
30954<>273_4<>arthur l. corcoran<>using real-valued genetic algorithms to evolve rule sets for classification<>icec<>sandip sen<>
29226<>280_67<>christian s. jensen:james clifford:ramez elmasri:shashi k. gadia:patrick j. hayes<>a consensus glossary of temporal database concepts<>sigmod<>sushil jajodia<>
29249<>280_90<>paul ammann<>an efficient multiversion algorithm for secure servicing of transaction reads<>ccs<>sushil jajodia<>
29260<>280_101<>pierangela samarati:paul ammann<>propagation of authorizations in distributed database systems<>ccs<>sushil jajodia<>
29335<>280_176<>amihai motro:donald g. marks<>aggregation in relational databases: controlled disclosure of sensitive information<>esorics<>sushil jajodia<>
29349<>280_190<>vijayalakshmi atluri:elisa bertino<>"degrees of isolation, concurrency control protocols, and commit protocols."<>dbsec<>sushil jajodia<>
33774<>293_6<>nulo<>amalgamating knowledge bases<>tods<>v. s. subrahmanian<>
23624<>333_64<>joseph y. halpern:yoram moses<>algorithmic knowledge<>tark<>moshe y. vardi<>
23678<>333_118<>pierre wolper<>reasoning about infinite computations<>iandc<>moshe y. vardi<>
23682<>333_122<>ronald fagin:joseph y. halpern:yoram moses<>an operational semantics for knowledge bases<>aaai<>moshe y. vardi<>
23685<>333_125<>surajit chaudhuri<>on the complexity of equivalence between recursive and nonrecursive datalog programs<>pods<>moshe y. vardi<>
23690<>333_130<>nulo<>nontraditional applications of automata theory<>tacs<>moshe y. vardi<>
31405<>334_1<>joseph s. b. mitchell:david m. mount<>query-sensitive ray shooting<>compgeom<>subhash suri<>
31412<>334_8<>john hershberger:monika rauch<>data structures for two-edge connectivity in planar graphs<>tcs<>subhash suri<>
33309<>355_41<>apostolos gerasoulis<>dsc: scheduling parallel tasks on an unbounded number of processors<>tpds<>tao yang<>
14657<>387_1<>jin ho kwak<>enumeration of graph embeddings<>dm<>jaeun lee<>
14670<>418_0<>neville moray<>"trust, self-confidence, and operators' adaptation to automation."<>ijmms<>john d. lee<>
22769<>424_22<>dan halperin<>"spheres, molecules, and hidden surface removal."<>compgeom<>mark h. overmars<>
22809<>424_62<>a. frank van der stappen<>range searching and point location among fat objects<>esa<>mark h. overmars<>
22817<>424_70<>micha sharir<>an improved technique for output-sensitive hidden surface removal<>algorithmica<>mark h. overmars<>
22862<>424_115<>mark de berg:dan halperin:jack snoeyink:marc j. van kreveld<>efficient ray shooting and hidden surface removal<>algorithmica<>mark h. overmars<>
22872<>424_125<>marc j. van kreveld<>concatenable structures for decomposable problems<>iandc<>mark h. overmars<>
22876<>424_129<>mark de berg:otfried schwarzkopf<>computing and verifying depth orders<>siamcomp<>mark h. overmars<>
14680<>452_0<>soon-ae yang:david stuart robertson<>use of case-based reasoning in the domain of building regulations<>ewcbr<>john lee<>
1100<>480_1<>monica s. lam<>communication-free parallelization via affine transformations<>lcpc<>amy w. lim<>
19430<>485_5<>nulo<>a syntactic stratification condition using constraints<>slp<>kenneth a. ross<>
19438<>485_13<>nulo<>modular stratification and magic sets for datalog programs with negation<>jacm<>kenneth a. ross<>
19444<>485_19<>raghu ramakrishnan:divesh srivastava:s. sudarshan<>efficient incremental evaluation of queries with aggregation<>slp<>kenneth a. ross<>
19450<>485_25<>nulo<>constraint stratification in deductive databases<>deductive<>kenneth a. ross<>
19469<>485_44<>nulo<>on negation in hilog<>jlp<>kenneth a. ross<>
19479<>485_54<>divesh srivastava:peter j. stuckey:s. sudarshan<>foundations of aggregation constraints<>ppcp<>kenneth a. ross<>
15315<>527_3<>nulo<>metabank: a knowledge-base of metaphoric language conventions<>ci<>james h. martin<>
33925<>529_20<>eric w. brown:james p. callan:j. eliot b. moss<>supporting full-text information retrieval with a persistent object store<>edbt<>w. bruce croft<>
33932<>529_27<>nulo<>integrating text and database systems: possibilities and challenges<>ewdw<>w. bruce croft<>
25325<>546_2<>edward l. lee:garth a. gibson:randy h. katz:david a. patterson<>"raid: high-performance, reliable secondary storage"<>csur<>peter m. chen<>
6043<>557_0<>chung-ming huang:ye-in chang<>a state-transition-based incremental protocol specification<>acm<>duen-tay huang<>
37<>563_0<>don murray<>motion tracking with an active camera<>pami<>anup basu<>
29<>564_1<>santonu sarkar<>an object oriented environment for modeling and synthesis of hardware circuits<>vlsid<>anupam basu<>
27886<>576_3<>james r. driscoll:daniel dominic sleator<>fully persistent lists with catenation<>jacm<>robert endre tarjan<>
6260<>591_39<>wang-chien lee<>using path information for query processing in object-oriented database systems<>cikm<>dik lun lee<>
6312<>592_2<>majid sarrafzadeh<>restricted track assignment with applications<>ijcga<>d. t. lee<>
6332<>592_22<>kuo-hui tsai<>k-best cuts for circular-arc graphs<>isaac<>d. t. lee<>
6286<>594_5<>mihalis yannakakis<>testing finite-state machines: state identification and verification<>tc<>david lee<>
6358<>599_2<>michael recce<>quantitative evaluation of the exploration strategies of a mobile robot<>aaai<>david lee<>
418<>622_0<>colin cooper<>hamilton cycles in a class of random directed graphs<>jct<>alan m. frieze<>
431<>622_13<>andrei z. broder:eli shamir:eli upfal<>near-perfect token distribution<>rsa<>alan m. frieze<>
440<>622_22<>brendan d. mckay<>multicolored trees in random graphs<>rsa<>alan m. frieze<>
455<>622_37<>andrei z. broder:stephen suen:eli upfal<>optimal construction of edge-disjoint paths in random graphs<>soda<>alan m. frieze<>
465<>622_47<>stephen suen<>on the independence number of random cubic graphs<>rsa<>alan m. frieze<>
470<>622_52<>andrei z. broder:eli shamir<>finding hidden hamiltonian cycles<>rsa<>alan m. frieze<>
475<>622_57<>colin cooper:michael molloy<>hamilton cycles in random regular digraphs<>cpc<>alan m. frieze<>
490<>622_72<>michael molloy<>broadcasting in random graphs<>dam<>alan m. frieze<>
31823<>672_3<>j. b. g. frenk:joaquim a. s. gromicho<>a deep cut ellipsoid algorithm for convex programming: theory and applications<>mp<>shuzhong zhang<>
29695<>696_2<>hantao zhang<>modgen: theorem proving by model generation<>aaai<>sun kim<>
25780<>702_44<>avraham leff<>a performance study of robust distributed load sharing strategies<>tpds<>philip s. yu<>
25790<>702_54<>arif merchant<>an analytical model of reconstruction time in mirrored disks<>pe<>philip s. yu<>
25791<>702_55<>sudarshan s. chawathe:ming-syan chen<>on index selection schemes for nested object hierarchies<>vldb<>philip s. yu<>
25792<>702_56<>ming-syan chen:dilip d. kandlur<>support for fully interactive playout in disk-array-based video server<>mm<>philip s. yu<>
25804<>702_68<>kun-lung wu:james z. teng<>data placement and buffer management for concurrent mergesorts with parallel prefetching<>icde<>philip s. yu<>
25806<>702_70<>asit dan<>performance evaluation of transaction processing coupling architectures for handling system dynamics<>tpds<>philip s. yu<>
25810<>702_74<>ming-syan chen:tao-heng yang:t.-s. liu<>on parallel transaction processing in a coupled system<>icpads<>philip s. yu<>
25814<>702_78<>calton pu:miu k. tsang:kun-lung wu<>multiversion divergence control of time fuzziness<>cikm<>philip s. yu<>
25828<>702_92<>john turek:uwe schwiegelshohn:joel l. wolf<>scheduling parallel tasks to minimize average response time<>soda<>philip s. yu<>
25842<>702_106<>asit dan:daniel m. dias<>buffer analysis for a data sharing environment with skewed data access<>tkde<>philip s. yu<>
25850<>702_114<>john turek:walter ludwig:joel l. wolf:lisa fleischer:prasoon tiwari:jason glasgow:uwe schwiegelshohn<>scheduling parallelizable tasks to minimize average response time<>spaa<>philip s. yu<>
25872<>702_136<>asit dan:daniel m. dias<>performance modelling and comparisons of global shared buffer management policies in a cluster environment<>tc<>philip s. yu<>
25878<>702_142<>kun-lung wu:asit dan<>dynamic parity grouping for improving write performance of raid-5 disk arrays<>icpp<>philip s. yu<>
18176<>728_0<>rong lin:stephan olariu:james l. schwing<>computing on reconfigurable buses - a new computational paradigm<>ppl<>jingyuan zhang<>
18177<>728_1<>dharmavani bhagavathi:venkatavasu bokka:himabindu gurla:stephan olariu:james l. schwing:ivan stojmenovic<>time-optimal visibility-related algorithms on meshes with multiple broadcasting<>ipps<>jingyuan zhang<>
18185<>728_9<>dharmavani bhagavathi:peter j. looges:stephan olariu:james l. schwing<>a fast selection algorithm for meshes with multiple broadcasting<>tpds<>jingyuan zhang<>
18190<>728_14<>dharmavani bhagavathi:stephan olariu:james l. schwing<>time- and cost-optimal parallel algorithms for the dominance and visibility graphs<>vlsid<>jingyuan zhang<>
31929<>748_32<>alan l. yuille<>a framework for shape representation and recognition<>icip<>song chun zhu<>
12304<>759_11<>nulo<>relating complexity to practical performance in parsing with wide-coverage unification grammars<>acl<>john carroll<>
12269<>761_0<>jurgen koenemann-belliveau:mary beth rosson:mark k. singley<>comparative usability evaluation: critical incidents and critical threads<>chi<>john m. carroll<>
12276<>761_7<>nulo<>making use a design representation<>cacm<>john m. carroll<>
12277<>761_8<>robert l. mack:scott p. robertson:mary beth rosson<>binding objects to scenarios of use<>ijmms<>john m. carroll<>
12282<>761_13<>jurgen koenemann-belliveau:mary beth rosson:mark k. singley<>comparative usability evaluation: critical incidents and critical threads<>chi<>john m. carroll<>
19066<>763_0<>k.-f. mak<>accel: a concurrent class extension language<>ifip<>k.-h. lee<>
19080<>777_0<>nulo<>"hangul, the korean writing system, and its computational treatment."<>ldvf<>kiyong lee<>
40664<>828_9<>nulo<>a parallel algorithm for finding a triconnected component separator with an application<>ipl<>zhi-zhong chen<>
21232<>832_1<>ursula hinkel:tobias nipkow:christian prehofer:birgit schieder<>interpreter verification for a functional language<>fsttcs<>manfred broy<>
21240<>832_9<>nulo<>equations for describing dynamic nets of communicating systems<>compass<>manfred broy<>
21247<>832_16<>nulo<>advanced component interface specification<>tppp<>manfred broy<>
21265<>832_34<>nulo<>a functional solution to the rpc-memory specification problem<>dagstuhl<>manfred broy<>
19798<>872_0<>hoon choi:vidyadhar g. kulkarni<>markov regenerative stochastic petri nets<>pe<>kishor s. trivedi<>
19751<>889_0<>hongjun lu:beng chin ooi<>efficient image retrieval by color contents<>adb<>kian-lee tan<>
6053<>898_0<>eugene j. rollins<>a new model of program dependences for reverse engineering<>sigsoft<>daniel jackson<>
6054<>898_1<>nulo<>abstract model checking of infinite specifications<>fm<>daniel jackson<>
14635<>913_6<>myoung-ho kim:yoon-joon lee<>ranking documents in thesaurus-based boolean retrieval systems<>ipm<>joon ho lee<>
14564<>950_0<>brian tierney:william e. johnston:hanan herzog:gary hoo:guojun jin:ling tony chen:doron rotem<>using high speed networks to enable distributed parallel image server systems<>sc<>jason lee<>
14569<>950_5<>brian tierney:ling tony chen:hanan herzog:gary hoo:guojun jin:william e. johnston<>distributed parallel data storage systems: a scalable approach to high speed image servers<>mm<>jason lee<>
22885<>956_0<>sasan iman:kamal chaudhary<>technology mapping using fuzzy logic<>dac<>massoud pedram<>
22908<>956_23<>chi-ying tsui:alvin m. despain<>exact and approximate methods for calculating signal and transition probabilities in fsms<>dac<>massoud pedram<>
22938<>956_53<>chi-ying tsui:chih-ang chen:alvin m. despain<>low power state assignment targeting two-and multi-level logic implementations<>iccad<>massoud pedram<>
22962<>956_77<>debaditya mukherjee:melvin a. breuer<>control strategies for chip-based dft/bist hardware<>itc<>massoud pedram<>
23038<>956_153<>yung-te lai:kuo-rueih ricky pan<>fpga synthesis using function decomposition<>iccd<>massoud pedram<>
23039<>956_154<>sasan iman<>multi-level network optimization for low power<>iccad<>massoud pedram<>
20640<>974_1<>joao gabriel silva:henrique madeira:jorge bernardino<>a fault-tolerant mechanism for simple controllers<>edcc<>luis moura silva<>
31979<>988_7<>kester li:roger kumpf:paul horton<>a quantitative analysis of disk drive power management in portable computers<>usenix<>thomas e. anderson<>
23547<>1022_5<>paul m. aoki:robert devine:witold litwin:michael a. olson<>mariposa: a new architecture for distributed data<>icde<>michael stonebraker<>
738<>1038_2<>allan l. fisher<>tradeoffs in canonical sequential function representations<>iccd<>aarti gupta<>
744<>1042_0<>sanjai tiwari<>constraint management on distributed design databases<>debu<>ashish gupta<>
745<>1042_1<>yehoshua sagiv:jeffrey d. ullman:jennifer widom<>constraint checking with partial information<>pods<>ashish gupta<>
22089<>1047_66<>angus macintyre<>polynomial bounds for vc dimension of sigmoidal neural networks<>eccc<>marek karpinski<>
37080<>1068_29<>pavol hell:huishan zhou<>multiplicativity of oriented cycles<>jct<>xuding zhu<>
37092<>1068_41<>pavol hell<>homomorphisms to oriented paths<>dm<>xuding zhu<>
38497<>1097_0<>nulo<>new systolic arrays for the longest common subsequence problem<>pc<>yen-chun lin<>
38487<>1099_24<>tsing-fa lee:allen c.-h. wu:daniel d. gajski<>a transformation-based method for loop folding<>tcad<>youn-long lin<>
38491<>1099_28<>yi-min jiang:tsing-fa lee:tingting hwang<>performance-driven interconnection optimization for microarchitecture synthesis<>tcad<>youn-long lin<>
38411<>1100_0<>nulo<>fault tolerant distributed simulation<>jise<>yi-bing lin<>
38423<>1100_12<>nulo<>determining the global progress of parallel simulation with fifo communication property<>ipl<>yi-bing lin<>
38427<>1100_16<>nulo<>memory management algorithms for optimistic parallel simulation<>isci<>yi-bing lin<>
38448<>1100_37<>victor wing-kit mak<>eliminating the boundary effect of a large-scale personal communication service network simulation<>tomacs<>yi-bing lin<>
38449<>1100_38<>dan daly<>a flexible graphical user interface for performance modeling<>mascots<>yi-bing lin<>
28332<>1114_5<>richard pollack:marie-francoise roy<>on the combinatorial and algebraic complexity of quantifier elimination<>focs<>saugata basu<>
28341<>1114_14<>dipanwita roy chowdhury:idranil sen gupta:parimal pal chaudhuri<>design of caecc-cellular automata based error correcting code<>tc<>saugata basu<>
3317<>1128_1<>m. ranganathan:yannis manolopoulos<>fast subsequence matching in time-series databases<>sigmod<>christos faloutsos<>
3321<>1128_5<>ron barber:myron flickner:jim hafner:wayne niblack:dragutin petkovic:william equitz<>efficient and effective querying by image content<>jiis<>christos faloutsos<>
17891<>1188_2<>s. e. salcudean<>towards a force-reflecting motion-scaling system for microsurgery<>icra<>joseph yan<>
1567<>1193_12<>gilles hurteau:m. hancu:vincent van dongen:h. hum<>a performance debugger for a language supporting data distribution primitives<>icpp<>ajit singh<>
37618<>1199_1<>sha guo:wei sun:wei li:qing liu:weiping zhang<>panther: an inexpensive and integrated multimedia environment<>icmcs<>yi deng<>
27543<>1231_0<>dunja mladenic:ivan bratko:marko grobelnik<>using machine learning techniques to interpret results from discrete event simulation<>ecml<>ray j. paul<>
19954<>1267_0<>s. yin wa wong<>development of hybrid optimisation techniques based on genetic algorithms and simulated annealing<>evoW<>kit po wong<>
19957<>1267_3<>s. yin wa wong<>development of parallel hybrid optimisation techniques based on genetic algorithms and simulated annealing<>evoW<>kit po wong<>
19906<>1273_1<>john mylopoulos:martin stanley:morris bernstein:renato de mori:graham ewart:kostas kontogiannis:ettore merlo:hausi a. muller:scott r. tilley:marijana tomic<>towards an integrated toolset for program understanding<>cascon<>kenny wong<>
19907<>1273_2<>hausi a. muller:scott r. tilley<>understanding software systems using reverse engineering technology<>coodbse<>kenny wong<>
19909<>1273_4<>erich b. buss:renato de mori:w. morven gentleman:john henshaw:howard johnson:kostas kontogiannis:ettore merlo:hausi a. muller:john mylopoulos:santanu paul:atul prakash:martin stanley:scott r. tilley:joel troster<>investigating reverse engineering technologies for the cas program understanding project<>ibmsj<>kenny wong<>
9901<>1287_2<>ernst p. mucke<>three-dimensional alpha shapes<>tog<>herbert edelsbrunner<>
9907<>1289_2<>nimish r. shah<>triangulating topological spaces<>compgeom<>herbert edelsbrunner<>
9876<>1291_4<>pavel valtr:emo welzl<>cutting dense point sets in half<>compgeom<>herbert edelsbrunner<>
9880<>1291_8<>bernard chazelle:leonidas j. guibas:john hershberger:raimund seidel:micha sharir<>selecting heavily covered points<>siamcomp<>herbert edelsbrunner<>
29852<>1303_0<>koichiro tamura:masatoshi nei<>mega: molecular evolutionary genetics analysis software for microcomputers<>bioinformatics<>sudhir kumar<>
10048<>1316_1<>rakesh agrawal<>algorithms for searching massive graphs<>tkde<>h. v. jagadish<>
9922<>1338_0<>tak w. yan<>distributed selective dissemination of information<>pdis<>hector garcia-molina<>
4854<>1340_0<>nulo<>a new routing algorithm for cyclic shifts on brgc hypercubes<>ipl<>chien-min wang<>
8519<>1362_4<>ming yu yao:alexandre petrenko<>fault coverage analysis in respect to an fsm specification<>infocom<>gregor von bochmann<>
3745<>1368_1<>gene chun-hsiung chuang:shwu fang tsai<>cartoon animation and morphing by using the wavelet curve descriptor<>icip<>c. c. jay kuo<>
3746<>1368_2<>li-chien lin<>iterative signal extrapolation algorithms with wavelets<>iscas<>c. c. jay kuo<>
3749<>1368_5<>xiang-gen xia:zhen zhang<>recovery of multiband signals using finite samples<>iscas<>c. c. jay kuo<>
34387<>1391_0<>chris clifton<>semantic integration in heterogeneous databases using neural networks<>vldb<>wen-syan li<>
34376<>1400_3<>hong xie:yianni attikiouzel<>an efficient method of volume rendering for medical slices<>icip<>wanqing li<>
4760<>1414_2<>pau-choo chung:e-liang chen:yung-nien sun<>polygonal approximation using a competitive hopfield neural network<>pr<>ching-tsorng tsai<>
2599<>1416_0<>nulo<>fast software processing of motion jpeg video<>mm<>brian c. smith<>
1457<>1417_2<>angela y. wu<>geodesic convexity in discrete spaces<>isci<>azriel rosenfeld<>
23216<>1433_11<>yuetsu kodama:shuichi sakai:yoshinori yamaguchi<>em-c: programming with explicit parallelism and locality for em-4 multiprocessor<>ifipPACT<>mitsuhisa sato<>
23235<>1433_30<>yuetsu kodama:hirofumi sakane:yoshinori yamaguchi:shuichi sakai<>programming with distributed data structure for em-x multiprocessor<>tppp<>mitsuhisa sato<>
23240<>1433_35<>andrew sohn:shuichi sakai:yuetsu kodama:yoshinori yamaguchi<>nonnumeric search results on the em-4 distributed-memory multiprocessor<>sc<>mitsuhisa sato<>
23251<>1433_46<>yuetsu kodama:yoshinori yamaguchi:shuichi sakai<>experience with executing shared memory programs using fine-grain communication and multithreading in em-4<>ipps<>mitsuhisa sato<>
23257<>1434_2<>nulo<>a purely functional language with encapsulated assignment<>tacs<>masahiko sato<>
23264<>1434_9<>yukiyoshi kameyama<>conservativeness of lambda over lambda-sigma-calculus<>birthday<>masahiko sato<>
16129<>1441_3<>vijaya ramachandran<>planarity testing in parallel<>jcss<>john h. reif<>
16151<>1441_25<>nulo<>models and resource metrics for parallel and distributed computation<>ipps<>john h. reif<>
16160<>1441_34<>s. azhar:greg j. badros:a. glodjo:ming-yang kao<>data compression techniques for stock market prediction<>dcc<>john h. reif<>
16180<>1441_54<>stephen r. tate<>dynamic algebraic algorithms<>soda<>john h. reif<>
16189<>1441_63<>j. d. tygar:akitoshi yoshida<>computability and complexity of ray tracing<>dcg<>john h. reif<>
16209<>1441_83<>micha sharir<>motion planning in the presence of moving obstacles<>jacm<>john h. reif<>
16216<>1441_90<>james a. storer<>shortest paths in the plane with polygonal obstacles<>jacm<>john h. reif<>
13204<>1465_83<>robert a. van de geijn:david w. walker<>scalability issues affecting the design of a dense linear algebra library<>jpdc<>jack dongarra<>
13211<>1465_90<>vaidy s. sunderam:al geist:robert manchek<>"the pvm concurrent computing system: evolution, experiences, and trends."<>pc<>jack dongarra<>
40585<>1473_7<>wolfgang maass<>on-line learning of rectangles and unions of rectangles<>ml<>zhixiang chen<>
30252<>1486_9<>kenneth smith:allen e. herman:david mattox:m. silliman:m. lucenti:j. jacobs:d. chazin:m. lawley:michael p. case<>swift: system workbench for integrating and facilitating teams<>ijcis<>stephen c. y. lu<>
8989<>1492_4<>agostino dovier:eugenio g. omodeo:alberto policriti<>solving systems of equations over hypersets<>agp<>gianfranco rossi<>
8991<>1492_6<>paola bruscoli:agostino dovier:enrico pontelli<>compiling intensional sets in clp<>iclp<>gianfranco rossi<>
12902<>1499_51<>rajive bagrodia:zheng li:vikas jha:yuan chen<>parallel logic level simulation of vlsi circuits<>wsc<>jason cong<>
12910<>1499_59<>zheng li:rajive bagrodia<>acyclic multi-way partitioning of boolean networks<>dac<>jason cong<>
12914<>1499_63<>cheng-kok koh<>simultaneous driver and wire sizing for performance and power optimization<>iccad<>jason cong<>
12922<>1499_71<>yuzheng ding<>flowmap: an optimal technology mapping algorithm for delay optimization in lookup-table based fpga designs<>tcad<>jason cong<>
7633<>1520_20<>nulo<>estimating the size of the transitive closure in linear time<>focs<>edith cohen<>
7637<>1520_24<>nimrod megiddo<>new algorithms for generalized network flows<>mp<>edith cohen<>
7645<>1520_32<>nulo<>polylog-time and near-linear work approximation scheme for undirected shortest paths<>stoc<>edith cohen<>
5001<>1523_5<>francis c. m. lau<>optimal parameters for load balancing with the diffusion method in mesh networks<>ppl<>cheng-zhong xu<>
8178<>1532_5<>yinan n. shen:hannu kari:s. s. kim<>scheduling policies for fault tolerance in a vlsi processor<>dft<>fabrizio lombardi<>
8186<>1532_13<>d. schin:yinan n. shen<>an approach for uio generation for fsm verification and validation<>iscas<>fabrizio lombardi<>
28871<>1544_15<>richard fujimoto:kiran s. panesar:don allison:maria hybinette<>gtw: a time warp system for shared memory multiprocessors<>wsc<>samir ranjan das<>
18930<>1553_3<>michael i. schwartzbach<>injectivity of composite functions<>jsc<>kim s. larsen<>
18950<>1553_23<>joan boyar<>efficient rebalancing of chromatic search trees<>jcss<>kim s. larsen<>
18962<>1553_35<>nulo<>avl trees with relaxed balance<>ipps<>kim s. larsen<>
18967<>1553_40<>joan boyar:faith e. fich<>bounds on certain multiplications of affine combinations<>dam<>kim s. larsen<>
18995<>1554_27<>klaus havelund<>a refinement logic for the fork calculus<>pstv<>kim guldstrand larsen<>
19029<>1554_61<>klaus havelund<>the fork calculus<>njc<>kim guldstrand larsen<>
19032<>1554_64<>bernhard steffen:carsten weise<>the methodology of modal constraints<>dagstuhl<>kim guldstrand larsen<>
19118<>1563_37<>anthony yiu-cheung tang<>a modified edge recombination operator for the travelling salesman problem<>ppsn<>kwong-sak leung<>
19128<>1564_0<>william a. massey:ward whitt<>traffic models for wireless communication networks<>infocom<>kin k. leung<>
37433<>1609_0<>wen-tsuen chen<>constant time sorting on reconfigurable meshes<>tc<>yen-cheng chen<>
37387<>1615_2<>mark s. nixon:david w. thomas<>texture classification using statistical geometrical features<>icip<>yan qiu chen<>
37380<>1616_1<>p. pete chong:morgan y. tong<>the simon-yule approach to bibliometric modeling<>ipm<>ye-sho chen<>
13771<>1619_29<>jim welsh<>software documents: concepts and tools<>stp<>jun han<>
30505<>1627_4<>amihood amir:martin farach<>alphabet dependence in parameterized matching<>ipl<>s. muthukrishnan<>
30553<>1627_52<>ramesh hariharan<>optimal parallel algorithms for prefix matching<>icalp<>s. muthukrishnan<>
30611<>1627_110<>nulo<>on optimal strategies for searching in presence of errors<>soda<>s. muthukrishnan<>
23755<>1638_19<>peter stone:jim blythe<>the need for different domain-independent heuristics<>aips<>manuela m. veloso<>
23773<>1638_37<>jim blythe<>linkability: examining causal link commitments in partial-order planning<>aips<>manuela m. veloso<>
6696<>1691_30<>tatsuya suda<>an object-oriented framework for dynamically configuring extensible distributed systems<>dse<>douglas c. schmidt<>
16994<>1706_15<>ashish gupta:yehoshua sagiv:jennifer widom<>constraint checking with partial information<>pods<>jeffrey d. ullman<>
14510<>1765_0<>edmund h. durfee<>structured circuit semantics for reactive plan execution systems<>aaai<>jaeho lee<>
41092<>1783_28<>hugh mcguire:richard j. waldinger<>annotation-based deduction in temporal logic<>ictl<>zohar manna<>
41093<>1783_29<>edward y. chang:amir pnueli<>compositional verification of real-time systems<>lics<>zohar manna<>
41119<>1783_55<>thomas a. henzinger:amir pnueli<>temporal proof methodologies for timed transition systems<>iandc<>zohar manna<>
41122<>1783_58<>amir pnueli<>temporal verification diagrams<>tacs<>zohar manna<>
41136<>1783_72<>henny sipma<>specification and verification of controlled systems<>ftrtft<>zohar manna<>
8807<>1796_1<>keith d. gremban:shang-hua teng<>moments of inertia and graph separators<>soda<>gary l. miller<>
27691<>1824_0<>william harrison:harold ossher:david ungar<>subjectivity in object-oriented systems<>oopsm<>randall b. smith<>
27693<>1824_2<>mark lentczner:walter r. smith:antero taivalsaari:david ungar<>prototype-based languages: object lessons from class-free programming<>oopsm<>randall b. smith<>
38959<>1870_21<>yehuda afek:hagit attiya:alan fekete:michael j. fischer:nancy a. lynch:da-wei wang:lenore d. zuck<>reliable communication over unreliable channels<>jacm<>yishay mansour<>
38994<>1870_56<>michael j. kearns:dana ron:ronitt rubinfeld:robert e. schapire:linda sellie<>on the learnability of discrete distributions<>stoc<>yishay mansour<>
39019<>1870_81<>avrim blum:merrick l. furst:jeffrey c. jackson:michael j. kearns:steven rudich<>weakly learning dnf and characterizing statistical query learning using fourier analysis<>stoc<>yishay mansour<>
37515<>1872_0<>jason jen-yen chen<>a new object-oriented method integrating jackson structured programming method<>jss<>yao-ting tim chen<>
32433<>1898_16<>terunao soneoka<>logically instantaneous message passing in asynchronous distributed systems<>tc<>toshihide ibaraki<>
32434<>1898_17<>hiroshi nagamochi:kazuhiro nishimura<>computing all small cuts in undirected networks<>isaac<>toshihide ibaraki<>
32465<>1898_48<>hiroshi nagamochi:tadashi ono<>implementing an efficient minimum capacity cut algorithm<>mp<>toshihide ibaraki<>
3547<>1907_19<>james clifford:ramez elmasri:shashi k. gadia:patrick j. hayes:sushil jajodia<>a consensus glossary of temporal database concepts<>sigmod<>christian s. jensen<>
3549<>1907_21<>michael d. soo:richard t. snodgrass<>efficient evaluation of the valid-time natural join<>icde<>christian s. jensen<>
3557<>1907_29<>michael d. soo:richard t. snodgrass<>unifying temporal data models via a conceptual model<>is<>christian s. jensen<>
3594<>1907_66<>richard t. snodgrass:ilsoo ahn:gad ariav:don s. batory:james clifford:curtis e. dyreson:ramez elmasri:fabio grandi:wolfgang kafer:nick kline:krishna g. kulkarni:t. y. cliff leung:nikos a. lorentzos:john f. roddick:arie segev:michael d. soo:suryanarayana m. sripada<>tsql2 language specification<>sigmod<>christian s. jensen<>
3596<>1907_68<>richard t. snodgrass:ilsoo ahn:gad ariav:don s. batory:james clifford:curtis e. dyreson:ramez elmasri:fabio grandi:wolfgang kafer:nick kline:krishna g. kulkarni:t. y. cliff leung:nikos a. lorentzos:john f. roddick:arie segev:michael d. soo:suryanarayana m. sripada<>a tsql2 tutorial<>sigmod<>christian s. jensen<>
3711<>1935_1<>fouad a. tobagi<>optimum routing of multicast streams<>infocom<>ciro aloisio noronha jr.<>
9484<>1943_19<>klaus jansen<>on the complexity of the maximum cut problem<>stacs<>hans l. bodlaender<>
9501<>1943_36<>klaus jansen:gerhard j. woeginger<>scheduling with incompatible jobs<>dam<>hans l. bodlaender<>
9506<>1943_41<>shlomo moran:manfred k. warmuth<>the distributed bit complexity of the ring: from the anonymous to the non-anonymous case<>iandc<>hans l. bodlaender<>
9508<>1943_43<>gerard tel:nicola santoro<>trade-offs in non-reversing diameter<>njc<>hans l. bodlaender<>
9509<>1943_44<>nulo<>on disjoint cycles<>ijfcs<>hans l. bodlaender<>
9510<>1943_45<>nulo<>improved self-reduction algorithms for graphs with bounded treewidth<>dam<>hans l. bodlaender<>
9538<>1943_73<>rodney g. downey:michael r. fellows:harold t. wareham<>the parameterized complexity of sequence alignment and consensus<>cpm<>hans l. bodlaender<>
26339<>1945_28<>per-ake larson<>establishing a fuzzy cost model for query optimization in a multidatabase system<>hicss<>qiang zhu<>
34894<>1954_19<>aditya p. mathur<>an empirical comparison of data flow and mutation-based test adequacy criteria<>stvr<>w. eric wong<>
34940<>1955_19<>eiichi goto<>fast evaluation of the elementary functions in double precision<>hicss<>w. f. wong<>
31339<>1959_0<>c. a. alonso sanches<>simd algorithms for matrix multiplication on the hypercube<>ipps<>s. w. song<>
31359<>1959_20<>afonso ferreira:alfredo goldman vel lejbman<>broadcasting in bus interconnection networks<>conpar<>siang w. song<>
31373<>1959_34<>afonso ferreira:alfredo goldman vel lejbman<>bus-based parallel computers: a viable way for massive parallelism<>parle<>siang w. song<>
9217<>1961_38<>kyu-young whang:sang-wook kim<>dynamic maintenance of data distribution for selectivity estimation<>vldb<>gio wiederhold<>
11987<>1964_0<>jiping liu<>dominating subgraphs in graphs with some forbidden structures<>dm<>huishan zhou<>
11991<>1964_4<>pavol hell:xingxing yu<>independence ratios of graph powers<>dm<>huishan zhou<>
11996<>1964_9<>pavol hell:xuding zhu<>multiplicativity of oriented cycles<>jct<>huishan zhou<>
11997<>1964_10<>jiping liu<>graphs and digraphs with given girth and connectivity<>dm<>huishan zhou<>
11999<>1964_12<>kejie ma:jianqin zhou<>on the ascending star subgraph decomposition of star forests<>combinatorica<>huishan zhou<>
4655<>1995_1<>ju yuan hsiao:ruay shiung chang:richard c. t. lee<>single step searching in weighted block graphs<>isci<>chuan yi tang<>
27893<>1997_3<>p. s. young<>human-executed operations in the teamware process programming system<>ispw<>richard n. taylor<>
27909<>1997_19<>kenneth m. anderson:e. james whitehead jr.<>chimera: hypertext for heterogeneous software environments<>echt<>richard n. taylor<>
27926<>1997_36<>joelle coutaz<>introduction to the workshop on software engineering and human-computer interaction: joint research issues<>icse<>richard n. taylor<>
4404<>2007_1<>nikolaos papanikolopoulos<>computation of shape through controlled active exploration<>icra<>christopher e. smith<>
4437<>2008_27<>bernie wong<>spe evaluation of a client/server application<>cmg<>connie u. smith<>
29520<>2019_10<>abhijit dharchoudhury:k. h. (kane) kim:s. h. lee<>fast and accurate timing simulation with regionwise quadratic models of mos i-v characteristics<>iccad<>sung-mo kang<>
29552<>2019_42<>sachin s. sapatnekar:pravin m. vaidya<>convexity-based algorithms for design centering<>tcad<>sung-mo kang<>
29554<>2019_44<>abhijit dharchoudhury:h. cha:j. h. patel<>fast timing simulation of transient faults in digital circuits<>iccad<>sung-mo kang<>
29476<>2020_7<>katsushi ikeuchi<>determination of motion breakpoints in a task sequence from human hand motion<>icra<>sing bing kang<>
27961<>2031_16<>noga alon:paul d. seymour<>planar separators<>siamdm<>robin thomas<>
27969<>2031_24<>xingxing yu<>4-connected projective-planar graphs are hamiltonian<>jct<>robin thomas<>
27970<>2031_25<>paul d. seymour<>call routing and the ratcatcher<>combinatorica<>robin thomas<>
27984<>2031_39<>neil robertson:paul d. seymour<>quickly excluding a planar graph<>jct<>robin thomas<>
16268<>2037_11<>shamik d. sharma:ravi ponnusamy:bongki moon:yuan-shin hwang:raja das<>run-time and compile-time support for adaptive irregular problems<>sc<>joel h. saltz<>
39878<>2040_19<>jim welsh<>integration of semantic tools into document editors<>stp<>yun yang<>
39884<>2040_25<>nulo<>effective integration of multiple tools in a loosely-coupled tool interfacing paradigm for case<>ifip8<>yun yang<>
39842<>2041_19<>nulo<>expert network: effective and efficient learning from human decisions in text categorization and retrieval<>sigir<>yiming yang<>
12051<>2049_24<>farokh b. bastani<>warm standby in hierarchically structured process-control programs<>tse<>ing-ray chen<>
12053<>2049_26<>bryant l. poole<>performance evaluation of rule grouping on a real-time expert system architecture<>tkde<>ing-ray chen<>
24450<>2083_6<>shalini yajnik<>graceful degradation in algorithm-based fault tolerant multiprocessor systems<>iscas<>niraj k. jha<>
24462<>2083_18<>sying-jyan wang<>algorithm-based fault tolerance for fft networks<>tc<>niraj k. jha<>
24474<>2083_30<>shalini yajnik<>synthesis of fault tolerant architectures for molecular dynamics<>iscas<>niraj k. jha<>
24477<>2083_33<>bapiraju vinnakota<>design of algorithm-based fault-tolerant multiprocessor systems for concurrent error detection and fault diagnosis<>tpds<>niraj k. jha<>
24498<>2083_54<>steven w. burns<>a totally self-checking checker for a parallel unordered coding scheme<>tc<>niraj k. jha<>
24515<>2083_71<>sandeep bhatia<>genesis: a behavioral synthesis system for hierarchical testability<>eurodac<>niraj k. jha<>
24568<>2083_124<>sandeep bhatia<>behavioral synthesis for hierarchical testability of controller/data path circuits with conditional branches<>iccd<>niraj k. jha<>
24572<>2083_128<>jennifer rexford<>partitioned encoding schemes for algorithm-based fault tolerance in massively parallel systems<>tpds<>niraj k. jha<>
24618<>2083_174<>anand raghunathan<>behavioral synthesis for low power<>iccd<>niraj k. jha<>
21516<>2087_0<>jin kim:sakti pramanik<>multiple sequence alignment using simulated annealing<>bioinformatics<>m. j. chung<>
40976<>2129_15<>mathai joseph<>stepwise development of fault-tolerant reactive systems<>ftrtft<>zhiming liu<>
4182<>2133_8<>michael p. wellman<>state-space abstraction for anytime evaluation of probabilistic networks<>uai<>chao-lin liu<>
14448<>2148_0<>harold szu:insook kim<>live neural network formations on electronic chips<>ijon<>jung hwan kim<>
31218<>2179_2<>ray h. kemp<>domain and task representation for tutorial process models<>ijmms<>s. p. smith<>
31230<>2179_14<>ray h. kemp<>using planning techniques to provide feedback in interactive learning environments<>ictai<>s. p. smith<>
31250<>2180_19<>david perry greene<>using coverage as a model building constraint in learning classifier systems<>ec<>stephen f. smith<>
31255<>2180_24<>cheng-chung cheng<>generating feasible schedules under complex metric constraints<>aaai<>stephen f. smith<>
31266<>2180_35<>robert j. aarts<>a high performance scheduler for an automated chemistry workstation<>ecai<>stephen f. smith<>
41262<>2183_1<>wei wang<>extension of lower probabilities and coherence of belief measures<>ipmu<>zhenyuan wang<>
40209<>2194_15<>alan k. mackworth<>specification and verification of constraint-based dynamic systems<>ppcp<>ying zhang<>
40212<>2194_18<>alan k. mackworth<>synthesis of hybrid constraint-based controllers<>hybrid<>ying zhang<>
26819<>2237_13<>claudionor jose nunes coelho jr.:giovanni de micheli<>program implementation schemes for hardware-software systems<>computer<>rajesh k. gupta<>
6994<>2267_16<>david terman<>synchrony and desynchrony in neural oscillator networks<>nips<>deliang l. wang<>
3454<>2285_1<>keh-jiann chen:yun-yan yang<>character-based collocation for mandarin chinese<>coling<>chu-ren huang<>
3465<>2288_1<>ye-in chang:duen-tay huang<>a state-transition-based incremental protocol specification<>acm<>chung-ming huang<>
23203<>2291_3<>d. t. lee<>restricted track assignment with applications<>ijcga<>majid sarrafzadeh<>
27745<>2308_4<>paola bertolazzi:robert f. cohen:giuseppe di battista:ioannis g. tollis<>how to draw a series-parallel digraph<>ijcga<>roberto tamassia<>
27837<>2308_96<>peter bro miltersen:sairam subramanian:jeffrey scott vitter<>complexity models for incremental computation<>tcs<>roberto tamassia<>
27852<>2308_111<>giuseppe di battista:peter eades:ioannis g. tollis<>algorithms for drawing graphs: an annotated bibliography<>comgeo<>roberto tamassia<>
27863<>2308_122<>ashim garg<>advances in graph drawing<>ciac<>roberto tamassia<>
32046<>2317_31<>nulo<>a simple trapezoid sweep algorithm for reporting red/blue segment intersections<>cccg<>timothy m. chan<>
32012<>2318_1<>siu leung chung:teck hua ho<>timing of software replacement<>icis<>taizan chan<>
21424<>2326_66<>tao-heng yang:philip s. yu:t.-s. liu<>on parallel transaction processing in a coupled system<>icpads<>ming-syan chen<>
21427<>2326_69<>sudarshan s. chawathe:philip s. yu<>on index selection schemes for nested object hierarchies<>vldb<>ming-syan chen<>
21458<>2326_100<>hui-i hsiao:philip s. yu<>on parallel execution of multiple pipelined hash joins<>sigmod<>ming-syan chen<>
21345<>2327_10<>mark w. jones<>a new approach to the construction of surfaces from contour data<>cgf<>min chen<>
23806<>2355_3<>nulo<>on the logic of theory base change<>jelia<>mary-anne williams<>
23808<>2355_5<>nulo<>transmutations of knowledge systems<>kr<>mary-anne williams<>
23809<>2355_6<>nulo<>explanation and theory base transmutations<>ecai<>mary-anne williams<>
17556<>2361_19<>larry brown<>dynamic snooping in a fault-tolerant distributed shared memory<>icdcs<>jie wu<>
17600<>2361_63<>nulo<>an optimal fault-tolerant nonredundant broadcasting scheme in injured hypercubes<>jpdc<>jie wu<>
17630<>2361_93<>y. wang:eduardo b. fernandez<>a uniform approach to software and hardware fault tolerance<>jss<>jie wu<>
17632<>2361_95<>nulo<>dimension-exchange-based load balancing on injured hypercubes<>icpp<>jie wu<>
17655<>2361_118<>eduardo b. fernandez:minjie h. fernandez<>user group structures in object-oriented database authorization<>dbsec<>jie wu<>
32186<>2375_0<>yasuhisa hasegawa:koji shimojima<>hierarchical fuzzy reasoning<>icec<>toshio fukuda<>
1724<>2381_46<>david zuckerman<>computing with very weak random sources<>focs<>aravind srinivasan<>
39678<>2410_1<>ben brown:shigeru aoki:takeo kanade<>mobility and manipulation of a light-weight space robot<>ras<>yangsheng xu<>
39679<>2410_2<>jie yang:c. s. chen<>gesture interface: modeling and learning<>icra<>yangsheng xu<>
39716<>2415_9<>richard j. mural:edward c. uberbacher<>constructing gene models from accurately predicted exons: an application of dynamic programming<>bioinformatics<>ying xu<>
27328<>2427_6<>david beasley:david r. bull<>complexity reduction using expansive coding<>aisb<>ralph r. martin<>
27353<>2427_31<>helen sims-coomber<>an implementation of logo for elliptic geometry<>cg<>ralph r. martin<>
37670<>2432_4<>jiawei han<>dynamic generation and refinement of concept hierarchies for knowledge discovery in databases<>kdd<>yongjian fu<>
37674<>2432_8<>jiawei han:raymond t. ng<>cooperative query answering using multiple layered databases<>coopis<>yongjian fu<>
12441<>2522_41<>nulo<>a linear-time algorithm for isomorphism of graphs of bounded average genus<>siamdm<>jianer chen<>
12451<>2522_51<>jonathan l. gross:robert g. rieper<>overlap matrices and total imbedding distributions<>dm<>jianer chen<>
5315<>2544_5<>hong-jian lai:xingxing yu<>small circuit double covers of cubic multigraphs<>jct<>cun-quan zhang<>
37919<>2626_1<>m. ammar<>quantization based on statistical moments for signal detection: design and analysis<>tit<>yih-fang huang<>
19201<>2637_0<>cezary dubnicki:malena r. mesarina<>network interface support for user-level buffer management<>pcrcw<>kai li<>
19202<>2637_1<>matthias a. blumrich:richard alpert:cezary dubnicki:edward w. felten:jonathan sandberg<>virtual memory mapped network interface for the shrimp multicomputer<>isca<>kai li<>
19205<>2637_4<>pei cao:edward w. felten<>application-controlled file caching policies<>usenix<>kai li<>
19206<>2637_5<>karin petersen<>an evaluation of multiprocessor cache coherence based on virtual memory support<>ipps<>kai li<>
12026<>2646_0<>patrick a. v. hall:john h. r. may<>knowledge engineering helps testing protection software<>seke<>hong zhu<>
22170<>2660_0<>michael gonzalez harbour:john p. lehoczky<>timing analysis for fixed-priority scheduling of hard real-time systems<>tse<>mark h. klein<>
30998<>2683_30<>renling jin<>the strength of the isomorphism property<>jsyml<>saharon shelah<>
31018<>2683_50<>steven givant<>universal theories categorical in power and kappa-generated models<>apal<>saharon shelah<>
31069<>2683_101<>nulo<>cardinalities of topologies with small base<>apal<>saharon shelah<>
31071<>2683_103<>joel spencer<>random sparse unary predicates<>rsa<>saharon shelah<>
31085<>2683_117<>lorenz halbeisen<>consequences of arithmetic for set theory<>jsyml<>saharon shelah<>
31086<>2683_118<>renling jin<>essential kurepa trees versus essential jech-kunen trees<>apal<>saharon shelah<>
23865<>2684_8<>michael fisher<>a decision procedure for a temporal belief logic<>ictl<>michael wooldridge<>
23875<>2684_18<>nulo<>coherent social action<>ecai<>michael wooldridge<>
23948<>2684_91<>nicholas r. jennings<>towards a theory of cooperative problem solving<>maamaw<>michael wooldridge<>
23950<>2684_93<>nulo<>this is myworld: the logic of an agent-oriented dai testbed<>ecaiw<>michael wooldridge<>
21283<>2703_14<>gunther sablon:luc de raedt<>iterative versionspaces<>ai<>maurice bruynooghe<>
8891<>2734_7<>victor mitrana:grzegorz rozenberg<>structuring grammar systems by priorities and hierarchies<>actaC<>gheorghe paun<>
8892<>2734_8<>gabriel istrate<>some combinatorial properties of self-reading sequences<>dam<>gheorghe paun<>
8894<>2734_10<>grzegorz rozenberg<>prescribed teams of grammars<>acta<>gheorghe paun<>
8946<>2734_62<>nulo<>marcus contextual grammars<>eatcs<>gheorghe paun<>
14308<>2748_0<>marite kirikova<>software requirements acquisition through enterprise modelling<>seke<>janis a. bubenko jr.<>
7158<>2750_5<>babak falsafi:alvin r. lebeck:steven k. reinhardt:ioannis schoinas:mark d. hill:james r. larus:anne rogers<>application-specific protocols for user-level shared memory<>sc<>david a. wood<>
7160<>2750_7<>ioannis schoinas:babak falsafi:alvin r. lebeck:steven k. reinhardt:james r. larus<>fine-grain access control for distributed shared memory<>asplos<>david a. wood<>
7165<>2750_12<>doug burger:rahmat s. hyder:barton p. miller<>paging tradeoffs in distributed-shared-memory multiprocessors<>sc<>david a. wood<>
31118<>2773_12<>nulo<>reinforcement learning algorithms for average-payoff markovian decision processes<>aaai<>satinder p. singh<>
31134<>2773_28<>richard c. yee<>an upper bound on the loss from approximate optimal-value functions<>ml<>satinder p. singh<>
31137<>2773_31<>tommi jaakkola:michael i. jordan<>reinforcement learning with soft state aggregation<>nips<>satinder p. singh<>
31156<>2773_50<>tommi jaakkola:michael i. jordan<>learning without state-estimation in partially observable markovian decision processes<>icml<>satinder p. singh<>
10529<>2777_0<>evelyne flandrin:jean-luc fouquet<>hamiltonicity of bipartite biclaw-free graphs<>dam<>hao li<>
31180<>2780_3<>herman herman<>first results in the autonomous retrieval of buried objects<>icra<>sanjiv singh<>
13459<>2800_0<>qian-ping gu<>algorithms and average time bounds of sorting on a mesh-connected computer<>tpds<>jun gu<>
32388<>2821_1<>taizan chan:siu leung chung<>timing of software replacement<>icis<>teck hua ho<>
21894<>2834_4<>mita d. desai<>an adaptive approach for texture modelling<>icip<>michael t. johnson<>
21889<>2836_0<>ian c. parmee:s. burt<>techniques to aid global search in engineering design<>ieaaie<>m. johnson<>
28088<>2840_2<>nulo<>von electronic-mail zu multimedialer post<>insk<>r. weber<>
21886<>2848_2<>pattie maes:trevor darrell<>evolving visual routines<>alife<>michael patrick johnson<>
6160<>2850_3<>naoyuki nomura:robert c. berwick<>"an architecture for a universal lexicon: a case study on shared syntactic information in japanese, hindi, bengali, greek, and english."<>coling<>douglas a. jones<>
6162<>2853_1<>richard n. czerwinski:william d. o'brien jr.<>edge detection in ultrasound speckle noise<>icip<>douglas l. jones<>
4930<>2859_1<>yew-huey liu:c. benveniste:c.-l. chen:w.-h. chiang<>trace-based analysis and tuning for distributed parallel applications<>icpads<>ching-farn eric wu<>
2021<>2876_0<>ko-wei lih<>equitable coloring of trees<>jct<>bor-liang chen<>
2025<>2876_4<>ko-wei lih:pou-lin wu<>equitable coloring and the maximum degree<>ejc<>bor-liang chen<>
2026<>2876_5<>hung-lin fu<>edge domination in complete partite graphs<>dm<>bor-liang chen<>
36650<>2900_11<>robin thomas<>4-connected projective-planar graphs are hamiltonian<>jct<>xingxing yu<>
36654<>2900_15<>hong-jian lai:cun-quan zhang<>small circuit double covers of cubic multigraphs<>jct<>xingxing yu<>
26234<>2902_19<>n. anupindi:m. an:james w. cooley<>a new and efficient fft algorithm for distributed memory systems<>icpads<>q. yang<>
26235<>2902_20<>qi gan:chenyi hu<>parallel all-row preconditioned interval linear solver for nonlinear equations on multiprocessors<>pc<>qing yang<>
26112<>2903_14<>shuo bai:guiyou qiu<>a framework for automatic problem decomposition in planning<>aips<>qiang yang<>
26125<>2903_27<>fahiem bacchus<>downward refinement and the efficiency of hierarchical problem solving<>ai<>qiang yang<>
26182<>2903_84<>alex y. m. chan<>delaying variable binding commitments in planning<>aips<>qiang yang<>
26253<>2909_1<>nulo<>computation of chain queries in distributed database systems<>acm<>qi yang<>
929<>2949_1<>nulo<>a study of spatial clustering techniques<>dexa<>akhil kumar<>
21286<>2954_0<>kurt p. brown:manish mehta:miron livny<>towards automated performance tuning for complex workloads<>vldb<>michael j. carey<>
21288<>2954_2<>paul m. bober<>indexing alternatives for multiversion locking<>edbt<>michael j. carey<>
21290<>2954_4<>jignesh m. patel:mary k. vernon<>accurate modeling of the hybrid hash join algorithm<>sigmetrics<>michael j. carey<>
21291<>2954_5<>hweehwa pang:miron livny<>managing memory for real-time queries<>sigmod<>michael j. carey<>
21292<>2954_6<>david j. dewitt:chander kant:jeffrey f. naughton<>a status report on the oo7 oodbms benchmarking effort<>oopsla<>michael j. carey<>
21295<>2954_9<>berthold reinwald:stefan desloch:tobin j. lehman:hamid pirahesh:v. srinivasan<>making real data persistent: initial experiences with smrc<>pos<>michael j. carey<>
21296<>2954_10<>david j. dewitt:michael j. franklin:nancy e. hall:mark l. mcauliffe:jeffrey f. naughton:daniel t. schuh:marvin h. solomon:c. k. tan:odysseas g. tsatalos:seth j. white:michael j. zwilling<>shoring up persistent applications<>sigmod<>michael j. carey<>
21298<>2954_12<>michael j. franklin:markos zaharioudakis<>fine-grained sharing in a page server oodbms<>sigmod<>michael j. carey<>
29965<>3027_4<>minho lee:cheol hoon park<>a new neuro-fuzzy identification model of nonlinear dynamic systems<>ijar<>soo-young lee<>
19526<>3044_7<>bodhisattwa mukherjee:dilma silva:ahmed gheith<>ktk: kernel support for configurable objects and invocations<>dse<>karsten schwan<>
19572<>3044_53<>greg eisenhauer:weiming gu:niru mallavarupu<>falcon - toward interactive parallel programs: the on-line steering of a molecular dynamics application<>hpdc<>karsten schwan<>
19586<>3044_67<>weiming gu:jeffrey s. vetter<>an annotated bibliography of interactive program steering<>sigplan<>karsten schwan<>
13526<>3047_0<>fahiem bacchus:adam j. grove:daphne koller<>generating new beliefs from old<>uai<>joseph y. halpern<>
13540<>3047_14<>nir friedman<>on the complexity of conditional logics<>kr<>joseph y. halpern<>
13556<>3047_30<>ronald fagin:yoram moses:moshe y. vardi<>an operational semantics for knowledge bases<>aaai<>joseph y. halpern<>
13571<>3047_45<>adam j. grove:daphne koller<>random worlds and maximum entropy<>jair<>joseph y. halpern<>
13581<>3047_55<>fahiem bacchus:adam j. grove:daphne koller<>forming beliefs about a changing world<>aaai<>joseph y. halpern<>
13595<>3047_69<>martin abadi<>decidability and expressiveness for first-order logics of probability<>iandc<>joseph y. halpern<>
13607<>3047_81<>yoram moses:moshe y. vardi<>algorithmic knowledge<>tark<>joseph y. halpern<>
13632<>3047_106<>bruce m. kapron<>zero-one laws for modal logic<>apal<>joseph y. halpern<>
13637<>3047_111<>fahiem bacchus:adam j. grove:daphne koller<>"a response to ""believing on the basis of the evidence""."<>ci<>joseph y. halpern<>
13642<>3047_116<>ronald fagin<>reasoning about knowledge and probability<>jacm<>joseph y. halpern<>
13662<>3047_136<>nir friedman<>conditional logics of belief change<>aaai<>joseph y. halpern<>
13724<>3047_198<>nir friedman<>"a knowledge-based framework for belief change, part ii: revision and update."<>kr<>joseph y. halpern<>
13741<>3047_215<>nir friedman<>"a knowledge-based framework for belief change, part i: foundations."<>tark<>joseph y. halpern<>
14939<>3059_0<>douglas comer<>probing tcp implementations<>usenix<>john c. lin<>
29385<>3060_8<>john launchbury<>lazy functional state threads<>pldi<>simon l. peyton jones<>
29413<>3060_36<>cordelia v. hall:kevin hammond:philip wadler<>type classes in haskell<>esop<>simon l. peyton jones<>
29421<>3060_44<>kevin hammond:james s. mattson jr.<>automatic spark strategies and granularity for a parallel functional language reducer<>conpar<>simon l. peyton jones<>
14930<>3066_1<>nulo<>consistent belief reasoning in the presence of inconsistency<>tark<>jinxin lin<>
5391<>3189_15<>chienhua chen:j. richard burke<>design and analysis of a class of highly scalable hierarchical networks: pdbcube<>jpdc<>dharma p. agrawal<>
4327<>3195_8<>milena mihail<>on the random walk method for protocol testing<>cav<>christos h. papadimitriou<>
4346<>3195_27<>elias koutsoupias<>beyond competitive analysis<>focs<>christos h. papadimitriou<>
39109<>3230_4<>shaoji xu:jinjie liu<>the chromaticity of s-bridge graphs and related graphs<>dm<>yee-hock peng<>
25423<>3278_1<>david s. touretzky<>connectionist models and linguistic theory: investigations of stress systems in language<>cogsci<>prahlad gupta<>
35689<>3286_0<>nulo<>on global sequence alignment<>bioinformatics<>x. huang<>
36226<>3308_1<>gerardo beni<>a least biased fuzzy clustering method<>pami<>xiaomin liu<>
35696<>3366_0<>d. frank hsu<>extremal problems in the construction of distributed loop networks<>siamdm<>xing-de jia<>
9791<>3407_2<>andrei state:david t. chen:chris tector:andrew brandt:ryutarou ohbuchi:michael bajura:henry fuchs<>case study: observing a volume rendered fetus within a pregnant patient<>visualization<>hong chen<>
1149<>3411_10<>bogdan s. chlebus:krzysztof diks<>sparse networks supporting efficient reliable broadcasting<>njc<>andrzej pelc<>
1178<>3411_39<>krzysztof diks<>fault-tolerant linear broadcasting<>cfcp<>andrzej pelc<>
1184<>3411_45<>douglas m. blough<>almost certain fault diagnosis through algorithm-based fault tolerance<>tpds<>andrzej pelc<>
1213<>3411_74<>bogdan s. chlebus:krzysztof diks<>waking up an anonymous faulty network from a single source<>hicss<>andrzej pelc<>
1222<>3411_83<>bogdan s. chlebus:krzysztof diks<>fast gossiping with short unreliable messages<>dam<>andrzej pelc<>
1237<>3411_98<>jurek czyzowicz:k. b. lakshmanan<>searching with local constraints on error patterns<>ejc<>andrzej pelc<>
1245<>3411_106<>piotr denejko:krzysztof diks:marek piotrow<>reliable minimum finding comparator networks<>mfcs<>andrzej pelc<>
1261<>3411_122<>krzysztof diks:evangelos kranakis:danny krizanc:bernard mans<>optimal coteries and voting schemes<>ipl<>andrzej pelc<>
1268<>3411_129<>bogdan s. chlebus:krzysztof diks<>sorting on a mesh-connected computer with delaying links<>siamdm<>andrzej pelc<>
1273<>3411_134<>krzysztof diks:evangelos kranakis:a. malinowsky<>the buffer potential of a network<>sirocco<>andrzej pelc<>
27261<>3427_2<>ju yuan hsiao:chuan yi tang:ruay shiung chang<>single step searching in weighted block graphs<>isci<>richard c. t. lee<>
1985<>3439_1<>andre van vliet:gerhard j. woeginger<>a lower bound for randomized on-line scheduling algorithms<>ipl<>bo chen<>
139<>3448_92<>carlo colombo:simone santini<>optical flow through relaxation in the velocity space<>prl<>alberto del bimbo<>
140<>3448_93<>pietro pala:simone santini<>visual image retrieval by elastic deformation of object sketches<>vl<>alberto del bimbo<>
147<>3448_100<>giacomo bucci:simone santini<>performance analysis of two different algorithms for ethernet-fddi interconnection<>tpds<>alberto del bimbo<>
16688<>3449_2<>stephane grumbach<>finitely representable databases<>pods<>jianwen su<>
16692<>3449_6<>terence r. smith:amitabh saran<>virtual structures - a technique for supporting scientific database applications<>er<>jianwen su<>
16699<>3449_13<>richard hull<>domain independence and the relational calculus<>acta<>jianwen su<>
16731<>3449_45<>stephane grumbach:christophe tollu<>linear constraint query languages: expressive power and complexity<>lcc<>jianwen su<>
27388<>3469_4<>murray shanahan<>narratives in the situation calculus<>logcom<>rob miller<>
26717<>3498_7<>pei-yung hsiao<>solving system partitioning problem using a massively parallel bio-computing network<>ifip<>ray-i chang<>
26720<>3500_1<>benny chor:oded goldreich:juris hartmanis:johan hastad:desh ranjan:pankaj rohatgi<>the random oracle hypothesis is false<>jcss<>richard chang<>
26721<>3502_0<>ju yuan hsiao:chuan yi tang:richard c. t. lee<>single step searching in weighted block graphs<>isci<>ruay shiung chang<>
26709<>3504_15<>nulo<>on the query complexity of clique size and maximum satisfiability<>coco<>richard chang<>
18039<>3526_8<>li-yan yuan<>a three-valued semantics for deductive databases and logic programs<>jcss<>jia-huai you<>
18053<>3526_22<>robert cartwright<>tractable argumentation semantics via iterative belief revision<>slp<>jia-huai you<>
24177<>3566_7<>changning huang<>an efficient syntactic tagging tool for corpora<>coling<>ming zhou<>
9052<>3575_1<>andrzej ehrenfeucht:tero harju<>incremental construction of 2-structures<>dm<>grzegorz rozenberg<>
9058<>3575_7<>tero harju<>reductions for primitive 2-structures<>fuin<>grzegorz rozenberg<>
22402<>3590_2<>paul m. b. vitanyi<>kolmogorov complexity arguments in combinatorics<>jct<>ming li<>
22422<>3590_22<>tao jiang<>on the approximation of shortest common supersequences and longest common subsequences<>icalp<>ming li<>
22439<>3590_39<>paul m. b. vitanyi<>statistical properties of finite sequences with high kolmogorov complexity<>mst<>ming li<>
22444<>3590_44<>avrim blum:john tromp:mihalis yannakakis<>linear approximation of shortest superstrings<>jacm<>ming li<>
33758<>3608_8<>nulo<>bounded degree graph inference from walks<>jcss<>vijay v. raghavan<>
33759<>3608_9<>krishnan pillaipakkamnatt<>on the limits of proper learnability of subclasses of dnf formulas<>colt<>vijay v. raghavan<>
16544<>3656_35<>shih-fu chang<>transform features for texture classification and discrimination in large image databases<>icip<>john r. smith<>
8275<>3772_14<>ravi janardan<>widest-corridor problems<>njc<>franco p. preparata<>
32618<>3781_63<>conrad j. poelman<>a paraperspective factorization method for shape and motion recovery<>eccv<>takeo kanade<>
32631<>3781_76<>michael l. reed:lee e. weiss<>new technologies and applications in robotics<>cacm<>takeo kanade<>
18480<>3785_0<>kejie ma:huishan zhou<>on the ascending star subgraph decomposition of star forests<>combinatorica<>jianqin zhou<>
39901<>3796_1<>peter rowlinson<>the third ramsey numbers for graphs with at most four edges<>dm<>yuansheng yang<>
16935<>3812_10<>marvin v. zelkowitz<>measuring prime program complexity<>isci<>jianhui tian<>
1435<>3832_0<>brian carlisle:kenneth y. goldberg:jeff wiegley<>a pivoting gripper for feeding industrial parts<>icra<>anil s. rao<>
13278<>3833_10<>jan treur<>temporal theories of reasoning<>jelia<>joeri engelfriet<>
1426<>3834_1<>david morley:michael p. georgeff<>a monotonic formalism for events and systems of events<>logcom<>anand s. rao<>
26724<>3848_0<>shyam kuttikkad<>non-gaussian cfar techniques for target detection in high resolution sar images<>icip<>rama chellappa<>
27551<>3877_0<>praveen seshadri:miron livny<>sequence query processing<>sigmod<>raghu ramakrishnan<>
27558<>3877_7<>divesh srivastava:s. sudarshan:praveen seshadri<>the coral deductive system<>vldb<>raghu ramakrishnan<>
6076<>3890_13<>andrea s. lapaugh:ron y. pinter<>minimizing channel density by lateral shifting of components<>soda<>david s. johnson<>
6077<>3890_14<>elias dahlhaus:christos h. papadimitriou:paul d. seymour:mihalis yannakakis<>the complexity of multiterminal cuts<>siamcomp<>david s. johnson<>
38180<>3893_2<>hyung-sool oh<>detecting truncation point in steady-state simulation using chaos theory<>wsc<>young hae lee<>
38149<>3894_14<>kiran j. achyutuni<>managing multiple disjoint priority orders in priority queues<>infocom<>yann-hang lee<>
38189<>3903_2<>hwan-ik choi:byoung mo im:myoung-ho kim<>an efficient parallel join algorithm based on hypercube-partitioning<>pdis<>yoon-joon lee<>
38198<>3903_11<>jae soo yoo:jae-woo chang:myoung-ho kim<>the hs file: a new dynamic signature file method for efficient information retrieval<>dexa<>yoon-joon lee<>
38208<>3903_21<>joon ho lee:myoung-ho kim<>ranking documents in thesaurus-based boolean retrieval systems<>ipm<>yoon-joon lee<>
6624<>3922_0<>nulo<>adaptive bayesian decision model for motion segmentation<>prl<>daechul park<>
6625<>3922_1<>jinho choi<>a stable feedback control of the buffer state using the controlled lagrange multiplier method<>tip<>daechul park<>
19228<>3930_4<>h. v. jagadish:christos faloutsos<>the tv-tree: an index structure for high-dimensional data<>vldb<>king-ip lin<>
32690<>3955_3<>nulo<>representational strategy in the visual cortex<>icip<>tai sing lee<>
32409<>3961_1<>michael s. lew:kam wong<>learning and feature selection in stereo matching<>pami<>thomas s. huang<>
35768<>3970_25<>fuji zhang<>hamiltonicity of a type of interchange graphs<>dam<>xueliang li<>
35772<>3970_29<>cornelis hoede<>clique polynomials and independent set polynomials of graphs<>dm<>xueliang li<>
32394<>3971_0<>daphne koller:jitendra malik:gary h. ogasawara:b. rao:stuart j. russell:joseph weber<>automatic symbolic traffic scene analysis using belief networks<>aaai<>timothy huang<>
2403<>3975_23<>hongjun lu:kian-lee tan<>on spatially partitioned temporal join<>vldb<>beng chin ooi<>
2409<>3975_29<>cuie zhao:hongjun lu<>duet - a database user interface design environment<>jiis<>beng chin ooi<>
2432<>3975_52<>hongjun lu:kian-lee tan<>efficient image retrieval by color contents<>adb<>beng chin ooi<>
38011<>3988_7<>woobin lee:robert j. gove:christopher r. read<>mediastation 5000: integrating video and audio<>ieeemm<>yongmin kim<>
14271<>3995_8<>bonnie a. nardi<>user preferences for task-specific vs. generic application software<>chi<>jeff a. johnson<>
14255<>3996_0<>nulo<>visualizing textual redundancy in legacy source<>cascon<>j. howard johnson<>
33102<>4000_1<>nulo<>a divergence critic<>cade<>toby walsh<>
33112<>4000_11<>tetsuya yoshida:alan bundy:ian green:david a. basin<>coloured rippling: an extension of a theorem proving heuristic<>ecai<>toby walsh<>
33119<>4000_18<>ian p. gent<>easy problems are sometimes hard<>ai<>toby walsh<>
33123<>4000_22<>ian p. gent<>the sat phase transition<>ecai<>toby walsh<>
33130<>4000_29<>david a. basin<>a calculus for rippling<>ctrs<>toby walsh<>
33137<>4000_36<>ian p. gent<>the hardest random sat problems<>ki<>toby walsh<>
28850<>4005_0<>taizan chan:teck hua ho<>timing of software replacement<>icis<>siu leung chung<>
5548<>4064_1<>andrei state:chris tector:andrew brandt:hong chen:ryutarou ohbuchi:michael bajura:henry fuchs<>case study: observing a volume rendered fetus within a pregnant patient<>visualization<>david t. chen<>
33589<>4070_0<>aris m. ouksel:chayanika majumdar<>management of concurrency in interpolation based grid file organization and its performance<>isci<>vijay kumar<>
33793<>4083_1<>yen-cheng chen<>constant time sorting on reconfigurable meshes<>tc<>wen-tsuen chen<>
40476<>4092_0<>nulo<>multi-sensor image fusion<>icip<>yi-tong zhou<>
21670<>4104_9<>paul j. tanenbaum:edward r. scheinerman<>characterization and recognition of point-halfspace and related orders<>gd<>michael t. goodrich<>
21709<>4104_48<>hervo bronnimann<>almost optimal set covers in finite vc-dimension (preliminary version)<>compgeom<>michael t. goodrich<>
21745<>4104_84<>nancy m. amato:edgar a. ramos<>parallel algorithms for higher-dimensional convex hulls<>focs<>michael t. goodrich<>
21754<>4104_93<>mikhail j. atallah:s. rao kosaraju<>parallel algorithms for evaluating sequences of set-manipulation operations<>jacm<>michael t. goodrich<>
21758<>4104_97<>nulo<>efficient piecewise-linear function approximation using the uniform metric (preliminary version)<>compgeom<>michael t. goodrich<>
27057<>4105_46<>micah adler:peter gemmell:mor harchol-balter:claire kenyon<>selection in the presence of noise: the design of playoff systems<>soda<>richard m. karp<>
27094<>4105_83<>lisa hellerstein:garth a. gibson:randy h. katz:david a. patterson<>coding techniques for handling failures in large disk arrays<>algorithmica<>richard m. karp<>
27112<>4105_101<>nulo<>probabilistic recurrence relations<>jacm<>richard m. karp<>
27119<>4105_108<>farid alizadeh:deborah k. weisser:geoffrey zweig<>physical mapping of chromosomes using unique probes<>soda<>richard m. karp<>
35521<>4110_13<>chieh-ying kan<>algebraic petri nets and their applications<>acm<>xudong he<>
33563<>4122_13<>parris s. wellman:venkat krovi<>an adaptive mobility system for the disabled<>icra<>vijay kumar<>
33573<>4122_23<>nilanjan sarkar:xiaoping yun<>control of a single robot in a decentralized multi-robot system<>icra<>vijay kumar<>
34968<>4130_1<>mao-jiun j. wang:shiau-chyi chang:chih-ming liu<>a new edge detection method through template matching<>ijprai<>wen-yen wu<>
30475<>4146_4<>mark d. hill<>an evaluation of directory protocols for medium-scale shared-memory multiprocessors<>ics<>shubhendu s. mukherjee<>
30488<>4146_17<>paul r. wilson:sheetal v. kakkad<>anomalies and adaptation in the analysis and development of prepaging policies<>jss<>shubhendu s. mukherjee<>
3243<>4196_11<>chi-jen tzeng<>on the development paradigm of distributed applications<>icpads<>chih-ping chu<>
27618<>4222_0<>chris brink:katarina britz<>peirce algebras<>fac<>renate a. schmidt<>
16641<>4236_0<>nulo<>"association schemes, superschemes, and relations invariant under permutation groups."<>ejc<>jonathan d. h. smith<>
30313<>4241_3<>vivek tiwari:andrew wolfe<>power analysis of embedded software: a first step towards software power minimization<>iccad<>sharad malik<>
30317<>4241_7<>pranav ashar<>implicit computation of minimum-cost feedback-vertex sets for partial scan and other applications<>dac<>sharad malik<>
30334<>4241_24<>srinivas devadas:kurt keutzer:albert wang<>event suppression: improving the efficiency of timing simulation for synchronous digital circuits<>tcad<>sharad malik<>
30358<>4241_48<>guido araujo:srinivas devadas:kurt keutzer:stan y. liao:ashok sudarsanam:steven w. k. tjiang:albert wang<>challenges in code generation for embedded processors<>dagstuhl<>sharad malik<>
30370<>4241_60<>nulo<>analysis of cyclic combinational circuits<>tcad<>sharad malik<>
38813<>4257_0<>khalid j. siddiqui:d. r. hay:ching y. suen<>feature selection using a proximity-index optimization model<>prl<>y.-h. liu<>
22642<>4280_5<>cynthia dwork<>an efficient existentially unforgeable signature scheme and its applications<>crypto<>moni naor<>
22656<>4280_19<>avishai wool<>"the load, capacity and availability of quorum systems"<>focs<>moni naor<>
22677<>4280_40<>noga alon:manuel blum:amos fiat:sampath kannan:rafail ostrovsky<>matching nuts and bolts<>soda<>moni naor<>
22678<>4280_41<>adi shamir<>visual cryptography<>eurocrypt<>moni naor<>
22711<>4280_74<>manuel blum:william s. evans:peter gemmell:sampath kannan<>checking the correctness of memories<>algorithmica<>moni naor<>
22734<>4280_97<>rajeev motwani:joseph naor<>the probabilistic method yields deterministic parallel algorithms<>jcss<>moni naor<>
20844<>4301_14<>adam krzyzak:alan l. yuille<>"on radial basis function nets and kernel regression: statistical consistency, convergence rates, and receptive field size."<>nn<>lei xu<>
20851<>4301_21<>michael i. jordan:geoffrey e. hinton<>an alternative model for mixtures of experts<>nips<>lei xu<>
226<>4302_26<>rajeev thakur:rajesh bordawekar<>compiler and runtime support for out-of-core hpf programs<>ics<>alok n. choudhary<>
250<>4302_50<>zeki bozkus:geoffrey fox:tomasz haupt:sanjay ranka:min-you wu<>compiling fortran 90d/hpf for distributed memory mimd computers<>jpdc<>alok n. choudhary<>
259<>4302_59<>rajeev thakur<>all-to-all communication on meshes with wormhole routing<>ipps<>alok n. choudhary<>
292<>4302_92<>senthil krishnamoorthy<>a scalable distributed shared memory architecture<>jpdc<>alok n. choudhary<>
313<>4302_113<>rajeev thakur:geoffrey fox<>complete exchange on a wormhole routed mesh<>mascots<>alok n. choudhary<>
323<>4302_123<>juan miguel del rosario<>high-performance i/o for massively parallel computers: problems and prospects<>computer<>alok n. choudhary<>
20458<>4309_14<>roberto zicari:walter l. hursch:karl j. lieberherr<>polymorphic reuse mechanisms for object-oriented database specifications<>icde<>ling liu<>
25649<>4323_3<>nulo<>a defect in dempster-shafer theory<>uai<>pei wang<>
25655<>4323_9<>nulo<>from inheritance relation to nonaxiomatic logic<>ijar<>pei wang<>
25636<>4324_7<>nulo<>3d line image analysis - a heuristic parallel approach with learning and recognition<>isci<>patrick shen-pei wang<>
25645<>4324_16<>lik mui:arun agarwal:amar gupta<>an adaptive modular neural network with application to unconstrained character recognition<>ijprai<>patrick shen-pei wang<>
16272<>4333_1<>john j. leggett:john l. schnase<>hyperactive: extending an open hypermedia architecture to support agency<>tochi<>j. alfredo sanchez<>
16123<>4345_0<>luisa gargano:arthur l. liestman:dana s. richards<>reliable broadcasting<>dam<>joseph g. peters<>
16124<>4345_1<>sanjeev mahajan<>regularity and locality in k-terminal graphs<>dam<>joseph g. peters<>
38621<>4348_7<>robin j. popplestone<>a group theoretic formalization of surface contact<>ijrr<>yanxi liu<>
20089<>4359_9<>yannis manoussakis:zeng min song<>complementary cycles containing a fixed arc in diregular bipartite tournaments<>dm<>ke min zhang<>
38726<>4374_1<>zhengjun pan:lishan kang:jun he<>an evolutionary approach to adaptive model-building<>evoW<>yong liu<>
9250<>4388_13<>ulrich pferschy:en-yu yao<>partitioning graphs into two trees<>actaC<>gerhard j. woeginger<>
3188<>4443_0<>nulo<>mechanical verification of distributed algorithms in higher-order logic<>tphol<>ching-tsun chou<>
3189<>4443_1<>nulo<>a formal theory of undirected graphs in higher-order logic<>tphol<>ching-tsun chou<>
20230<>4457_0<>jue-hsuan hsiao:tzi-dar chiueh:chun-te chen<>high throughput cordic-based systolic array design for the discrete cosine transform<>iscas<>liang-gee chen<>
16479<>4485_29<>luis moura silva:henrique madeira:jorge bernardino<>a fault-tolerant mechanism for simple controllers<>edcc<>joao gabriel silva<>
16449<>4486_2<>jose silva matos:joao canas ferreira:ana c. leao<>an approach to testability improvement of mixed-signal boards<>iscas<>jose m. silva<>
28904<>4494_14<>mehmet hakan karaata:sriram v. pemmaraju:steven c. bruell<>self-stabilizing algorithms for finding centers and medians of trees<>podc<>sukumar ghosh<>
21945<>4516_2<>min chen<>a new approach to the construction of surfaces from contour data<>cgf<>mark w. jones<>
21961<>4518_3<>nulo<>"ml typing, explicit polymorphism and qualified types."<>tacs<>mark p. jones<>
21964<>4518_6<>nulo<>dictionary-free overloading by partial evaluation<>pepm<>mark p. jones<>
21968<>4518_10<>nulo<>a theory of qualified types<>scp<>mark p. jones<>
21974<>4520_3<>nulo<>"don't emancipate, exaggerate: rhetoric, reality and reengineering."<>ifip8-2<>matthew jones<>
12570<>4527_0<>chia-ming tu<>an ada-like software process language<>jss<>jason jen-yen chen<>
12571<>4527_1<>yao-ting tim chen<>a new object-oriented method integrating jackson structured programming method<>jss<>jason jen-yen chen<>
12572<>4527_2<>yu-shiang hung<>an integrated object-oriented analysis and design method emphasizing entity/class relationship and operation finding<>jss<>jason jen-yen chen<>
10407<>4533_10<>bill jackson<>hamilton cycles in 2-connected regular bipartite graphs<>jct<>hao li<>
12541<>4562_5<>nulo<>the logic of only knowing as a unified framework for non-monotonic reasoning<>fuin<>jianhua chen<>
12546<>4562_10<>sukhamay kundu<>fuzzy logic or lukasiewicz logic: a clarification<>ismis<>jianhua chen<>
11010<>4566_33<>erik g. hoel<>data-parallel spatial join algorithms<>icpp<>hanan samet<>
11037<>4566_60<>chuan-heng ang<>a fast quadtree normalization algorithm<>prl<>hanan samet<>
11041<>4566_64<>nulo<>spatial databases<>adb<>hanan samet<>
11056<>4566_79<>walid g. aref<>a cost model for query optimization using r-trees<>gis<>hanan samet<>
11060<>4566_83<>erik g. hoel<>performance of data-parallel spatial operations<>vldb<>hanan samet<>
11112<>4566_135<>walid g. aref<>hashing by proximity to process duplicates in spatial databases<>cikm<>hanan samet<>
7258<>4585_0<>pascale fung<>improving chinese tokenization with linguistic filters on statistical lexical acquisition<>anlp<>dekai wu<>
7266<>4585_8<>nulo<>aligning a parallel english-chinese corpus statistically with lexical criteria<>acl<>dekai wu<>
12605<>4588_2<>svante carlsson:christer mattsson<>heaps with bits<>isaac<>jingsen chen<>
11322<>4654_10<>tatsuhiko tsunoda<>analysis of scene identification ability of associative memory with pictorial dictionary<>coling<>hidehiko tanaka<>
11333<>4654_21<>hidemoto nakada:takuya araki:hanpei koike<>a fleng compiler for pie64<>ifipPACT<>hidehiko tanaka<>
7104<>4670_1<>will e. leland:murad s. taqqu:walter willinger<>on the self-similar nature of ethernet traffic (extended version)<>ton<>daniel v. wilson<>
36349<>4671_2<>qing hu:hao dai:xiangzu wang<>optimal routing of permutations on rings<>isaac<>xiaojun shen<>
36350<>4671_3<>qing hu:weifa liang<>realization of an arbitrary permutation on a hypercube<>ipl<>xiaojun shen<>
36369<>4671_22<>qing hu:weifa liang<>efficient embedding k-ary complete trees into hypercubes<>ipps<>xiaojun shen<>
17517<>4701_1<>waqar hague<>distributed real-time nested transactions<>jss<>johnny s. wong<>
17518<>4701_2<>daniel c. schmitz:ron m. nelson<>design and implementation of national engineering education delivery system<>spe<>jonny s. wong<>
25296<>4710_1<>nulo<>architectural timing verification and test for super scalar processors<>ftcs<>pradip bose<>
17473<>4714_6<>jing-fei ren:jon w. mark<>performance analysis of a leaky-bucket controlled atm multiplexer<>pe<>johnny w. wong<>
17480<>4714_13<>hossam s. hassanein:jon w. mark<>an effective erasure node algorithm for slot reuse in dqdb<>infocom<>johnny w. wong<>
27598<>4718_15<>dana h. ballard<>seeing behind occlusions<>eccv<>rajesh p. n. rao<>
27605<>4718_22<>dana h. ballard<>learning saccadic eye movements using multiscale spatial filters<>nips<>rajesh p. n. rao<>
25192<>4720_5<>giuseppe di battista:william lenhart:giuseppe liotta<>proximity constraints and representable trees<>gd<>prosenjit bose<>
25223<>4720_36<>michael e. houle:godfried t. toussaint<>every set of disjoint line segments admits a binary tree<>isaac<>prosenjit bose<>
25224<>4720_37<>david bremner:godfried t. toussaint<>all convex polyhedra can be clamped with parallel jaw grippers<>cccg<>prosenjit bose<>
25242<>4720_55<>godfried t. toussaint<>geometric and computational aspects of manufacturing processes<>cg<>prosenjit bose<>
25276<>4720_89<>patrice belleville:jurek czyzowicz:jorge urrutia:joseph zaks<>k-guarding polygons on the plane<>cccg<>prosenjit bose<>
850<>4743_7<>mitchell p. marcus:mark steedman:bonnie l. webber<>research in natural language processing<>naacl<>aravind k. joshi<>
2259<>4765_71<>nulo<>integrating rules and constraints<>ictai<>bing liu<>
11229<>4796_0<>subhash saini<>applications performance on intel paragon xp/s-15<>hpcn<>horst d. simon<>
11265<>4800_8<>yumi iwasaki<>causality and model abstraction<>ai<>herbert a. simon<>
31422<>4826_0<>judea pearl<>qualitative decision theory<>aaai<>sek-wah tan<>
20274<>4844_3<>bernard chazelle:herbert edelsbrunner:john hershberger:raimund seidel:micha sharir<>selecting heavily covered points<>siamcomp<>leonidas j. guibas<>
38405<>4850_0<>nulo<>on the feedback vertex set problem in permutation graphs<>ipl<>y. daniel liang<>
38408<>4850_3<>chong jye rhee:sudarshan k. dhall:s. lakshmivarahan<>efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs<>ipl<>y. daniel liang<>
10151<>4874_9<>nulo<>on finite fixed sets in infinite graphs<>dm<>h. a. jung<>
22011<>4885_6<>shang-hua teng<>simple and efficient graph compression schemes for dense and complement graphs<>isaac<>ming-yang kao<>
22022<>4887_2<>ching-tien ho<>optimal broadcast in all-port wormhole-routed hypercubes<>icpp<>ming-yang kao<>
34278<>4890_14<>peter l. bartlett:robert c. williamson<>lower bounds on the vc-dimension of smoothly parametrized function classes<>colt<>wee sun lee<>
34217<>4893_31<>dik lun lee<>using path information for query processing in object-oriented database systems<>cikm<>wang-chien lee<>
15106<>4912_1<>yuansheng jiang<>new method for constructing isospectral graphs<>jcisd<>jun liu<>
31689<>4927_1<>david stuart robertson:john lee<>use of case-based reasoning in the domain of building regulations<>ewcbr<>soon-ae yang<>
15088<>4933_1<>katia p. sycara<>collective problem solving through coordinated reaction<>icec<>jyi-shane liu<>
15070<>4936_2<>huishan zhou<>dominating subgraphs in graphs with some forbidden structures<>dm<>jiping liu<>
15050<>4940_2<>allen j. schwenk<>the color-degree matrix and the number of multicolored trees in star decompositions<>jct<>j. q. liu<>
15051<>4940_3<>nulo<>hamiltonian decompositions of cayley graphs on abelian groups<>dm<>jiuqiang liu<>
11153<>4942_2<>shao dong chen:rodney w. topor<>an efficient permutation-based parallel range-join algorithm on n-dimensional torus computers<>ipl<>hong shen<>
33051<>4987_2<>hitoshi iba:hugo de garis<>system identification approach to genetic programming<>icec<>taisuke sato<>
33053<>4987_4<>hitoshi iba:hugo de garis<>genetic programming with local hill-climbing<>ppsn<>taisuke sato<>
18654<>5057_0<>norman l. allinger:liqun yan<>molecular mechanics calculations (mm2 and mm3) on enamines and aniline derivatives<>jcc<>kuo-hsiang chen<>
32734<>5060_0<>jose a. tierno:alain j. martin:drazen borkovic<>a 100-mips gaas asynchronous microprocessor<>dt<>tak-kwan lee<>
10838<>5065_0<>keith andrews:frank kappe:klaus schmaranz<>on second generation hypermedia systems<>jucs<>hermann a. maurer<>
10839<>5065_1<>klaus schmaranz<>j.ucs - the next generation in electronic journal publishing<>jucs<>hermann a. maurer<>
10840<>5065_2<>barry fenn<>harmony... on an expanding net<>interactions<>hermann a. maurer<>
24932<>5073_2<>myung hee kim<>"transformations between boundary codes, run length codes, and linear quadtrees."<>ipps<>oscar h. ibarra<>
24950<>5073_20<>qi zheng<>some efficient algorithms for permutation graphs<>jal<>oscar h. ibarra<>
24963<>5073_33<>nicholas q. tran<>on the parallel complexity of solving recurrence equations<>isaac<>oscar h. ibarra<>
24982<>5073_52<>nicholas q. tran<>on communication-bounded synchronized alternating finite automata<>acta<>oscar h. ibarra<>
25013<>5073_83<>tao jiang<>on some open problems concerning the complexity of cellular arrays<>birthday<>oscar h. ibarra<>
25049<>5073_119<>myung hee kim<>fast parallel algorithms for solving triangular systems of linear equations on the hypercube<>jpdc<>oscar h. ibarra<>
24208<>5078_16<>yuval roichman<>random cayley graphs and expanders<>rsa<>noga alon<>
24217<>5078_25<>richard a. duke:hanno lefmann:vojtech rodl:raphael yuster<>the algorithmic aspects of the regularity lemma<>jal<>noga alon<>
24244<>5078_52<>nulo<>probabilistic methods in coloring and decomposition problems<>dm<>noga alon<>
24259<>5078_67<>paul d. seymour:robin thomas<>planar separators<>siamdm<>noga alon<>
24268<>5078_76<>nulo<>explicit ramsey graphs and orthonormal labelings<>combinatorics<>noga alon<>
24272<>5078_80<>pavel pudlak<>superconcentrators of depths 2 and 3; odd levels help (rarely)<>jcss<>noga alon<>
24289<>5079_0<>alon orlitsky<>a lower bound on the expected length of one-to-one codes<>tit<>noga alon<>
32202<>5081_12<>xavier nicollin:joseph sifakis:sergio yovine<>symbolic model checking for real-time systems<>iandc<>thomas a. henzinger<>
32227<>5081_37<>pei-hsin ho<>a note on abstract interpretation strategies for hybrid automata<>hybrid<>thomas a. henzinger<>
32229<>5081_39<>zohar manna:amir pnueli<>temporal proof methodologies for timed transition systems<>iandc<>thomas a. henzinger<>
32232<>5081_42<>rajeev alur<>a really temporal logic<>jacm<>thomas a. henzinger<>
32244<>5081_54<>peter w. kopke<>verification methods for the divergent runs of clock systems<>ftrtft<>thomas a. henzinger<>
32285<>5081_95<>rajeev alur:limor fix<>a determinizable class of timed automata<>cav<>thomas a. henzinger<>
32304<>5081_114<>rajeev alur<>finitary fairness<>lics<>thomas a. henzinger<>
32309<>5081_119<>rajeev alur:costas courcoubetis<>the observational power of clocks<>concur<>thomas a. henzinger<>
32319<>5081_129<>pei-hsin ho<>hytech: the cornell hybrid technology tool<>hybrid<>thomas a. henzinger<>
35188<>5082_10<>sanjay kamat:gopal agrawal<>on available bandwidth in fddi-based reconfigurable networks<>infocom<>wei zhao<>
35222<>5082_44<>nicholas malcolm<>the timed-token protocol for real-time communications<>computer<>wei zhao<>
35247<>5082_69<>gopal agrawal:biao chen:sadegh davari<>guaranteeing synchronous message deadlines with the timed token medium access control protocol<>tc<>wei zhao<>
35250<>5082_72<>amitava raha:nicholas malcolm<>performance evaluation of admission policies in atm based embedded real-time systems<>lcn<>wei zhao<>
9426<>5105_2<>nulo<>a representation of sfp<>iandc<>guo-qiang zhang<>
9456<>5108_2<>nulo<>extremal regular graphs with prescribed odd girth<>jct<>guo-hui zhang<>
9457<>5108_3<>nulo<>pseudo-one-factorizations of regular graphs of odd order - ii. products of graphs<>dm<>guo-hui zhang<>
9458<>5108_4<>nulo<>some new bounds on single-change covering designs<>siamdm<>guo-hui zhang<>
41146<>5109_2<>krzysztof kuchcinski<>automated transformation of algorithms into register-transfer level implementations<>tcad<>zebo peng<>
37873<>5130_3<>r. j. blake<>numerical experiences with partitioning of unstructured meshes<>pc<>y. f. hu<>
15769<>5143_0<>r. michael young:martha e. pollack<>decomposition and causality in partial-order planning<>aips<>johanna d. moore<>
22326<>5148_5<>giuseppe de giacomo<>boosting the correspondence between description logics and propositional dynamic logics<>aaai<>maurizio lenzerini<>
22330<>5148_9<>francesco m. donini:daniele nardi:andrea schaerf<>deduction in concept languages: from subsumption to instance checking<>logcom<>maurizio lenzerini<>
22353<>5148_32<>marco cadoli<>the complexity of propositional closed world reasoning and circumscription<>jcss<>maurizio lenzerini<>
22373<>5148_52<>diego calvanese<>on the interaction between isa and cardinality constraints<>icde<>maurizio lenzerini<>
22376<>5148_55<>diego calvanese<>making object-oriented schemas more expressive<>pods<>maurizio lenzerini<>
22378<>5148_57<>diego calvanese:daniele nardi<>a unified framework for class-based representation formalisms<>kr<>maurizio lenzerini<>
23106<>5149_4<>maurizio rebaudengo<>a genetic algorithm for floorplan area optimization<>icec<>matteo sonza reorda<>
23191<>5149_89<>fulvio corno:paolo prinetto<>making the circular self-test path technique effective for real circuits<>itc<>matteo sonza reorda<>
23199<>5149_97<>paolo prinetto:maurizio rebaudengo<>an automatic test pattern generator for large sequential circuits based on genetic algorithms<>itc<>matteo sonza reorda<>
21602<>5157_33<>vasudha govindan<>speculative computation: overcoming communication delays<>icpp<>mark a. franklin<>
21608<>5163_5<>michael j. carey:markos zaharioudakis<>fine-grained sharing in a page server oodbms<>sigmod<>michael j. franklin<>
21630<>5163_27<>michael j. carey:david j. dewitt:nancy e. hall:mark l. mcauliffe:jeffrey f. naughton:daniel t. schuh:marvin h. solomon:c. k. tan:odysseas g. tsatalos:seth j. white:michael j. zwilling<>shoring up persistent applications<>sigmod<>michael j. franklin<>
8708<>5226_5<>ramaswamy govindarajan:erik r. altman<>a framework for resource-constrained rate-optimal software pipelining<>conpar<>guang r. gao<>
28108<>5255_0<>robert s. french:christopher s. wilson:saman p. amarasinghe:jennifer-ann m. anderson:steven w. k. tjiang:shih-wei liao:chau-wen tseng:mary w. hall:monica s. lam:john l. hennessy<>suif: an infrastructure for research on parallelizing and optimizing compilers<>sigplan<>robert p. wilson<>
28735<>5288_25<>jeff kramer<>an integrated method for effective behaviour analysis of distributed systems<>icse<>shing-chi cheung<>
40698<>5298_1<>alberto apostolico:dany breslauer<>parallel detection of all palindromes in a string<>stacs<>zvi galil<>
15676<>5326_6<>david m. mount:subhash suri<>query-sensitive ray shooting<>compgeom<>joseph s. b. mitchell<>
15706<>5326_36<>chong zhu:gopalakrishnan sundaram:jack snoeyink<>generating random x-monotone polygons with given vertices<>cccg<>joseph s. b. mitchell<>
15621<>5327_36<>kathleen fisher:furio honsell<>a lambda calculus of objects and method specialization<>njc<>john c. mitchell<>
15648<>5327_63<>dinesh katiyar:david c. luckham<>a type system for prototyping languages<>popl<>john c. mitchell<>
2499<>5328_3<>christopher ahlberg<>visual information seeking: tight coupling of dynamic query filters with starfield displays<>chi<>ben shneiderman<>
2503<>5328_7<>christopher ahlberg<>visual information seeking using the filmfinder<>chi<>ben shneiderman<>
2504<>5328_8<>christopher ahlberg<>visual information seeking: tight coupling of dynamic query filters with starfield displays<>chi<>ben shneiderman<>
2546<>5330_0<>ehud rivlin:rodrigo a. botafogo<>navigating in hyperspace: designing a structure-based toolbox<>cacm<>ben shneiderman<>
26419<>5357_24<>gadi taubenfeld<>contention-free complexity of shared memory algorithms<>podc<>rajeev alur<>
26441<>5357_46<>thomas a. henzinger<>a really temporal logic<>jacm<>rajeev alur<>
26458<>5357_63<>hagit attiya:gadi taubenfeld<>time-adaptive algorithms for synchronization<>stoc<>rajeev alur<>
26460<>5357_65<>costas courcoubetis:thomas a. henzinger<>the observational power of clocks<>concur<>rajeev alur<>
26473<>5357_78<>limor fix:thomas a. henzinger<>a determinizable class of timed automata<>cav<>rajeev alur<>
26481<>5357_86<>thomas a. henzinger<>finitary fairness<>lics<>rajeev alur<>
26487<>5357_92<>david l. dill<>a theory of timed automata<>tcs<>rajeev alur<>
24625<>5359_3<>kenneth j. goldman<>quorum consensus in nested transaction systems<>tods<>nancy a. lynch<>
24637<>5359_15<>hagit attiya:cynthia dwork:larry j. stockmeyer<>bounds on the time to reach agreement in the presence of timing uncertainty<>jacm<>nancy a. lynch<>
24663<>5359_41<>rainer gawlick:roberto segala:jorgen f. sogaard-andersen<>liveness in timed and untimed systems<>icalp<>nancy a. lynch<>
24696<>5359_74<>roberto segala<>probabilistic simulations for probabilistic processes<>concur<>nancy a. lynch<>
24711<>5359_89<>isaac saias:roberto segala<>proving time bounds for randomized distributed algorithms<>podc<>nancy a. lynch<>
24714<>5359_92<>hagit attiya<>time bounds for real-time process control in the presence of timing uncertainty<>iandc<>nancy a. lynch<>
24717<>5359_95<>yehuda afek:hagit attiya:alan fekete:michael j. fischer:yishay mansour:da-wei wang:lenore d. zuck<>reliable communication over unreliable channels<>jacm<>nancy a. lynch<>
24780<>5359_158<>victor luchangco:ekrem soylemez:stephen j. garland<>verifying timing properties of concurrent algorithms<>forte<>nancy a. lynch<>
24781<>5359_159<>hagit attiya:nir shavit<>are wait-free algorithms fast?<>jacm<>nancy a. lynch<>
15208<>5361_1<>sonia m. leach<>computing annotated logic programs<>iclp<>james j. lu<>
15209<>5361_2<>neil v. murray:erik rosenthal<>signed formulas and fuzzy operator logics<>ismis<>james j. lu<>
14151<>5376_11<>james w. durkin<>nonpolygonal isosurface rendering for large volume datasets<>visualization<>john f. hughes<>
14166<>5376_26<>maria m. loughlin<>an annotation system for 3d fluid flow visualization<>visualization<>john f. hughes<>
33064<>5385_0<>ian h. witten:timothy c. bell:alistair moffat:craig g. nevill-manning:harold w. thimbleby<>semantic and generative models for lossy text compression<>cj<>tony c. smith<>
14192<>5386_11<>john launchbury<>reversing abstract interpretations<>scp<>john hughes<>
26527<>5424_5<>nulo<>on fibonacci keystream generators<>fse<>ross j. anderson<>
26534<>5424_12<>nulo<>why cryptosystems fail<>cacm<>ross j. anderson<>
26536<>5424_14<>nulo<>searching for the optimum correlation attack<>fse<>ross j. anderson<>
37209<>5431_8<>laxmi n. bhuyan:akhilesh kumar<>a distributed cache coherence protocol for hypercube multiprocessors<>icpp<>yeimkuan chang<>
10912<>5445_2<>sabine van huffel<>parallel tri- and bi-diagonalization of bordered bidiagonal matrices<>pc<>haesun park<>
5203<>5447_0<>chris mellish<>an empirical study on the generation of zero anaphors in chinese<>coling<>ching-long yeh<>
34663<>5450_5<>ramin mojdehbakhsh:shekhar h. kirani:lynn elliott<>retrofitting software safety in an implantable medical device<>software<>wei-tek tsai<>
34668<>5450_10<>shekhar h. kirani:imran a. zualkernan<>evaluation of expert system testing methods<>cacm<>wei-tek tsai<>
34676<>5450_18<>sourav bhattacharya<>lookahead processor allocation in mesh-connected massively parallel multicomputer<>ipps<>wei-tek tsai<>
34680<>5450_22<>mohamed fayad:mark a. roberts:louis j. hawn:jay w. schooley<>adapting an object-oriented development method<>software<>wei-tek tsai<>
4039<>5451_0<>lawrence snyder<>accommodating polymorphic data decompositions in explicitly parallel programs<>ipps<>calvin lin<>
4043<>5451_4<>lawrence snyder<>simple performance results in zpl<>lcpc<>calvin lin<>
15463<>5456_37<>bernd van linder:wiebe van der hoek<>tests as epistemic updates<>ecai<>john-jules ch. meyer<>
15484<>5456_58<>wiebe van der hoek:bernd van linder<>a logic of capabilities<>lfcs<>john-jules ch. meyer<>
7463<>5470_3<>sunil choenni:henk m. blanken:thiel chang<>index configurations in object-oriented databases<>tools<>elisa bertino<>
7466<>5470_6<>giovanna guerrini:danilo montesi<>deductive object databases<>ecoop<>elisa bertino<>
7469<>5470_9<>barbara catania:giovanna guerrini:danilo montesi<>transaction optimization in rule databases<>ride<>elisa bertino<>
7482<>5470_22<>claudio bettini:pierangela samarati<>a temporal authorization model<>ccs<>elisa bertino<>
7489<>5470_29<>hans weigand<>an approach to authorization modeling in object-oriented database systems<>dke<>elisa bertino<>
7490<>5470_30<>amani a. saad:mohamed a. ismail<>clustering techniques in object bases: a survey<>dke<>elisa bertino<>
7498<>5470_38<>alessandro ciampichetti:luigi v. mancini<>mark-and-sweep garbage collection in multilevel secure object-oriented database systems<>esorics<>elisa bertino<>
7501<>5470_41<>vijayalakshmi atluri:sushil jajodia<>"degrees of isolation, concurrency control protocols, and commit protocols."<>dbsec<>elisa bertino<>
7506<>5470_46<>nulo<>index configuration in object-oriented databases<>vldb<>elisa bertino<>
7513<>5470_53<>giovanna guerrini:danilo montesi<>generic methods in deductive object databases<>oois<>elisa bertino<>
7524<>5470_64<>fabio origgi:pierangela samarati<>a new authorization model for object-oriented databases<>dbsec<>elisa bertino<>
16890<>5509_3<>ellen isaacs:monica rua<>supporting distributed groups with a montage of lightweight interactions<>cscw<>john c. tang<>
16895<>5509_8<>ellen isaacs<>what video can and cannot do for collaboration: a case study<>mms<>john c. tang<>
16896<>5509_9<>monica rua<>montage: providing teleproximity for distributed groups<>chi<>john c. tang<>
16897<>5509_10<>monica rua<>montage: providing teleproximity for distributed groups<>chi<>john c. tang<>
16868<>5514_0<>hao chen<>an efficient method for mutual exclusion in truly distributed systems<>icdcs<>jian tang<>
16870<>5514_2<>nulo<>on multilevel voting<>dc<>jian tang<>
37752<>5529_2<>lutz volkmann<>on complementary cycles in locally semicomplete digraphs<>dm<>yubao guo<>
37754<>5529_4<>lutz volkmann<>cycles in multipartite tournaments<>jct<>yubao guo<>
28982<>5558_9<>chen-huan chiang<>random pattern testable logic synthesis<>iccad<>sandeep k. gupta<>
28986<>5558_13<>chih-ang chen<>bist test pattern generators for stuck-open and delay testing<>eurodac<>sandeep k. gupta<>
28993<>5558_20<>seongmoon wang<>atpg for heat dissipation minimization during test application<>itc<>sandeep k. gupta<>
28998<>5558_25<>chen-yang pan:kwang-ting cheng<>a comprehensive fault macromodel for opamps<>iccad<>sandeep gupta<>
28999<>5558_26<>wen-chang fang<>clock grouping: a low cost dft methodology for delay testing<>dac<>sandeep k. gupta<>
8579<>5565_17<>akira saito<>graphs with a cycle of length divisible by three<>jct<>guantao chen<>
31779<>5578_4<>kai salomaa<>measures of nondeterminism for pushdown automata<>jcss<>sheng yu<>
3502<>5601_0<>yung-chow peng:chrong-kuang wang<>a bicmos limiting amplifier for sonet oc-3<>iscas<>chen-yi huang<>
36987<>5638_8<>shin-ichi nakano:takao nishizeki<>a parallel algorithm for edge-coloring partial k-trees<>swat<>xiao zhou<>
37005<>5638_26<>takao nishizeki<>edge-coloring and f-coloring for various classes of graphs<>isaac<>xiao zhou<>
37011<>5638_32<>takao nishizeki<>an efficient algorithm for edge-ranking trees<>esa<>xiao zhou<>
36920<>5640_7<>yanchun zhang:maria e. orlowska<>a new fragmentation scheme for recursive query processing<>dke<>xiaofang zhou<>
8664<>5648_7<>rajeev thakur:alok n. choudhary<>complete exchange on a wormhole routed mesh<>mascots<>geoffrey fox<>
8668<>5648_11<>zeki bozkus:alok n. choudhary:tomasz haupt:sanjay ranka:min-you wu<>compiling fortran 90d/hpf for distributed memory mimd computers<>jpdc<>geoffrey fox<>
8688<>5648_31<>philip rousselle:paul tymann:salim hariri<>the virtual computing environment<>hpdc<>geoffrey fox<>
8689<>5648_32<>nawal copty:sanjay ranka:ravi v. shankar<>a data parallel algorithm for solving the region growing problem on the connection machine<>jpdc<>geoffrey fox<>
8696<>5648_39<>manish parashar:salim hariri:tomasz haupt<>interpreting the performance of hpf/fortran 90d<>sc<>geoffrey fox<>
27439<>5672_17<>nulo<>average-case analysis of algorithms for matchings and related problems<>jacm<>rajeev motwani<>
27443<>5672_21<>anil kamath:krishna v. palem:paul g. spirakis<>tail bounds for occupancy and the satisfiability threshold conjecture<>focs<>rajeev motwani<>
27475<>5672_53<>steven phillips:eric torng<>non-clairvoyant scheduling<>tcs<>rajeev motwani<>
27509<>5672_87<>joseph naor:moni naor<>the probabilistic method yields deterministic parallel algorithms<>jcss<>rajeev motwani<>
27510<>5672_88<>david r. karger:madhu sudan<>approximate graph coloring by semidefinite programming<>focs<>rajeev motwani<>
27513<>5672_91<>madhu sudan<>computing roots of graphs is hard<>dam<>rajeev motwani<>
17260<>5701_5<>gung-wei chirn:thomas g. marr:bruce a. shapiro:dennis shasha:kaizhong zhang<>combinatorial pattern discovery for scientific data: some preliminary results<>sigmod<>jason tsong-li wang<>
17273<>5701_18<>dennis shasha:kaizhong zhang:frank y. shih<>exact and approximate algorithms for unordered tree matching<>tsmc<>jason tsong-li wang<>
17286<>5701_31<>kaizhong zhang:karpjoo jeong:dennis shasha<>a system for approximate tree matching<>tkde<>jason tsong-li wang<>
17292<>5701_37<>kaizhong zhang:dennis shasha<>approximate tree matching in the presence of variable length don't cares<>jal<>jason tsong-li wang<>
37191<>5714_3<>wan-chi siu<>a new adaptive interframe transform coding using directional classification<>icip<>yui-lam chan<>
35892<>5719_2<>zahir tari<>evolution of methods in object schema<>informaticaSI<>xue li<>
35893<>5719_3<>zahir tari<>consistency checking of evolving methods<>dexa<>xue li<>
28537<>5731_0<>torben hagerup<>prefix graphs and their applications<>wg<>shiva chaudhuri<>
33263<>5740_1<>ryohei nakano:yuval davidor<>optimal population size under constant computation cost<>ppsn<>takeshi yamada<>
24085<>5753_0<>jong-sen lee<>object identification from multiple images based on point matching under a general transformation<>pami<>mark chao kuen yang<>
24087<>5753_2<>jun siung huang<>discriminant analysis based on hyperellipsoid distribution<>jise<>mark chao kuen yang<>
17388<>5759_0<>edward h. adelson<>representing moving images with layers<>tip<>john y. a. wang<>
26942<>5762_0<>chiao-fe shu<>vector field analysis for oriented patterns<>pami<>ramesh jain<>
26941<>5763_1<>nulo<>multimedia computing<>ieeemm<>ramesh jain<>
24034<>5768_12<>nulo<>vertex-primitive digraphs of prime-power order are hamiltonian<>dm<>ming-yao xu<>
2636<>5794_35<>padraig cunningham<>a comparison of incremental case-based reasoning and inductive learning<>ewcbr<>barry smyth<>
2675<>5794_74<>padraig cunningham:tony veale<>on the limitations of memory based reasoning<>ewcbr<>barry smyth<>
40416<>5871_28<>thomas hardjono:jennifer seberry<>reusing shares in secret sharing schemes<>cj<>yuliang zheng<>
40417<>5871_29<>jennifer seberry:xian-mo zhang<>improving the strict avalanche characteristics of cryptographic functions<>ipl<>yuliang zheng<>
40423<>5871_35<>thomas hardjono:jennifer seberry<>database authentication revisited<>compsec<>yuliang zheng<>
40429<>5871_41<>chris charnes:luke o'connor:josef pieprzyk:reihaneh safavi-naini<>comments on soviet encryption algorithm<>eurocrypt<>yuliang zheng<>
7829<>5877_26<>joseph a. shaw<>combination of multiple searches<>trec<>edward a. fox<>
7847<>5877_44<>nulo<>how to make intelligent digital libraries<>ismis<>edward a. fox<>
12117<>5883_0<>harold szu:jung hwan kim<>live neural network formations on electronic chips<>ijon<>insook kim<>
16678<>5885_1<>bhaskar purimetla:rajendran m. sivasankaran:krithi ramamritham:donald f. towsley<>priority assignment in real-time active databases<>pdis<>john a. stankovic<>
4770<>5894_1<>seema hiranandani:ken kennedy:scott k. warren<>the d editor: a new interactive parallel programming tool<>sc<>chau-wen tseng<>
4785<>5894_16<>seema hiranandani:ken kennedy<>evaluating compiler optimizations for fortran d<>jpdc<>chau-wen tseng<>
4787<>5894_18<>steve carr:kathryn s. mckinley<>compiler optimizations for improving data locality<>asplos<>chau-wen tseng<>
4793<>5894_24<>robert p. wilson:robert s. french:christopher s. wilson:saman p. amarasinghe:jennifer-ann m. anderson:steven w. k. tjiang:shih-wei liao:mary w. hall:monica s. lam:john l. hennessy<>suif: an infrastructure for research on parallelizing and optimizing compilers<>sigplan<>chau-wen tseng<>
32931<>5913_2<>daniel e. neiman:david w. hildum:victor r. lesser<>exploiting meta-level information in a distributed scheduling system<>aaai<>tuomas sandholm<>
20008<>5917_12<>philip s. yu:james z. teng<>data placement and buffer management for concurrent mergesorts with parallel prefetching<>icde<>kun-lung wu<>
4464<>5957_0<>sheng-de wang<>"comments on ""distributed algorithms for network recognition problems""."<>tc<>cha-hon sun<>
21228<>5962_1<>john domingue:blaine a. price:john t. stasko<>software visualization<>chi<>marc brown<>
4517<>5977_2<>ying-hong liao:jing-liu lu:fu-may zheng<>genetic algorithm learning in game playing with multiple coaches<>icec<>chuen-tsai sun<>
21226<>5980_0<>blaize horner reich<>building it competence in line management: investigation of a best practice<>icis<>michelle brown<>
19681<>5985_19<>jyi-shane liu<>collective problem solving through coordinated reaction<>icec<>katia p. sycara<>
19705<>5985_43<>michael lewis<>modeling teams of specialists<>hicss<>katia p. sycara<>
24881<>6022_73<>richard chang:benny chor:juris hartmanis:johan hastad:desh ranjan:pankaj rohatgi<>the random oracle hypothesis is false<>jcss<>oded goldreich<>
24909<>6022_101<>yair oren<>definitions and properties of zero-knowledge proof systems<>joc<>oded goldreich<>
24916<>6022_108<>rafail ostrovsky:erez petrank<>computational complexity and knowledge complexity<>eccc<>oded goldreich<>
15545<>6025_5<>walter d. potter:robert w. robinson:krys kochut:d. z. redys<>using the genetic algorithm to find snake-in-the-box codes<>ieaaie<>john a. miller<>
28257<>6044_7<>victor o. k. li:chihping wang<>performance analysis of the send-on-demand: a distributed database concurrency control protocol for high-speed networks<>comcom<>sujata banerjee<>
28292<>6045_3<>dilip sarkar<>hypercube connected rings: a fault-tolerant and scalable architecture for virtual lightwave network topology<>infocom<>subrata banerjee<>
30156<>6066_0<>carver mead<>continuous-time adaptive delay system<>iscas<>shih-chii liu<>
784<>6077_7<>dimitris c. dracopoulos<>neuro-genetic adaptive attitude control<>nca<>antonia j. jones<>
1828<>6163_0<>sunil arya:david m. mount:nathan s. netanyahu:ruth silverman<>an optimal algorithm for approximate nearest neighbor searching<>soda<>angela y. wu<>
1830<>6164_0<>azriel rosenfeld<>geodesic convexity in discrete spaces<>isci<>angela y. wu<>
20361<>6166_0<>ido dagan:fernando c. n. pereira<>similarity-based estimation of word cooccurrence probabilities<>acl<>lillian lee<>
24306<>6192_12<>michael wooldridge<>towards a theory of cooperative problem solving<>maamaw<>nicholas r. jennings<>
24329<>6192_35<>jun huang:john fox<>an agent architecture for distributed medical care<>ecaiw<>nicholas r. jennings<>
24332<>6192_38<>michael wooldridge<>"agent theories, architectures, and languages: a survey."<>ecaiw<>nicholas r. jennings<>
24437<>6192_143<>benedita malheiro:eugenio oliveira<>belief revision in multi-agent systems<>ecai<>nicholas r. jennings<>
11460<>6222_3<>nulo<>"on k-factorizations of a complete bipartite graph."<>dm<>hong wang<>
7895<>6286_28<>leopold flatto:bjorn poonen:paul e. wright<>the processor minimization problem with independent waiting-time constraints<>tcs<>edward g. coffman jr.<>
7974<>6288_20<>kenneth m. anderson:richard n. taylor<>chimera: hypertext for heterogeneous software environments<>echt<>e. james whitehead jr.<>
10044<>6304_33<>seiichiro tani<>a reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs<>isaac<>hiroshi imai<>
720<>6348_18<>naomi nishimura<>sequential and parallel algorithms for embedding problems on classes of partial k-trees<>swat<>arvind gupta<>
666<>6352_0<>garrison w. greenwood:kelly mcsweeney<>scheduling tasks in multiprocessor systems using evolutionary strategies<>icec<>ajay gupta<>
668<>6352_2<>dalia motzkin<>parallel organization and performance of an information system<>sac<>ajay k. gupta<>
13011<>6357_23<>mubarak shah<>recognizing hand gestures<>eccv<>james w. davis<>
35326<>6360_3<>chris steketee:philip moseley<>implementation of process migration in amoeba<>icdcs<>weiping zhu<>
1584<>6370_2<>jeffrey d. gee<>the effectiveness of caches for vector processors<>ics<>alan jay smith<>
5615<>6379_11<>lindsay errington:chris hankin<>static analysis of value-passing process calculi<>imperial<>david clark<>
18884<>6382_21<>chim-fu yeung:sheung-lun hung<>performance evaluation of a new distributed deadlock detection algorithm<>sigmod<>kam-yiu lam<>
18896<>6382_33<>sheung-lun hung:kwok-wa lam<>efficient technique for performance analysis of locking protocols<>mascots<>kam-yiu lam<>
30668<>6405_0<>dinabandhu bhandari:malay k. kundu<>genetic algorithms for optimal image enhancement<>prl<>sankar k. pal<>
7607<>6427_0<>nulo<>automatic verification of finite-state concurrent systems<>lics<>edmund m. clarke<>
7612<>6427_5<>nulo<>automatic verification of finite-state concurrent systems<>apn<>edmund m. clarke<>
3810<>6437_4<>gyoung h. kim<>an evolutionary approach to the job-shop scheduling problem<>icra<>c. s. george lee<>
3814<>6437_8<>ethan z. evans<>automatic generation of error recovery knowledge through learned reactivity<>icra<>c. s. george lee<>
26945<>6440_0<>kent beck<>patterns generate architectures<>ecoop<>ralph e. johnson<>
18090<>6446_0<>david j. dewitt:navin kabra:jun luo:jignesh m. patel<>client-server paradise<>vldb<>jie-bing yu<>
2719<>6457_5<>hsu-chun yen:ming-sheng yang<>some complexity results for rings of petri nets<>ijfcs<>bow-yaw wang<>
37312<>6470_28<>winfried gorke<>structure-oriented dependability evaluation of fault-tolerant protocols<>jss<>yinong chen<>
25494<>6488_11<>nulo<>efficient algorithms for data distribution on distributed memory multicomputers<>icpads<>p. z. lee<>
9866<>6494_0<>vidyadhar g. kulkarni:kishor s. trivedi<>markov regenerative stochastic petri nets<>pe<>hoon choi<>
10059<>6540_7<>sibabrata ray:jitender s. deogun<>a parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors<>sac<>hong jiang<>
10080<>6540_28<>v. carl hamacher<>comparison of mesh and hierarchical networks for multiprocessors<>icpp<>hong jiang<>
28017<>6542_8<>michael dahlin:clifford mather:thomas e. anderson:david a. patterson<>a quantitative analysis of cache policies for scalable network file systems<>sigmetrics<>randolph y. wang<>
28020<>6542_11<>michael dahlin:thomas e. anderson:david a. patterson<>cooperative caching: using remote client memory to improve file system performance<>osdi<>randolph y. wang<>
28030<>6542_21<>soumen chakrabarti<>adaptive control for packet video<>icmcs<>randolph y. wang<>
39301<>6550_16<>ten-hwang lai:li-fen wu<>matrix representation of graph embedding in a hypercube<>jpdc<>yu-chee tseng<>
28381<>6555_0<>jonathan m. smith<>quad-tree segmentation for texture-based image query<>mm<>shih-fu chang<>
28403<>6555_22<>chien-tsai liu:panos k. chrysanthis<>database schema evolution using ever diagrams<>avi<>shi-kuo chang<>
28410<>6555_29<>nulo<>visual communications<>seke<>s. k. chang<>
28427<>6555_46<>patricia l. albacete:giuseppe polese:bruce r. baker<>iconic language design for people with significant speech and multiple impairments<>assets<>shi-kuo chang<>
28429<>6555_48<>chyi-ren dow:mary lou soffa<>undoing code transformations in an independent order<>icpp<>shi-kuo chang<>
28438<>6555_57<>giuseppe polese:sergio orefice:maurizio tucci<>a methodology and interactive environment for iconic language design<>ijmms<>shi-kuo chang<>
28454<>6555_73<>chyi-ren dow:mary lou soffa<>an efficient technique to remove transformations<>icpads<>shi-kuo chang<>
28465<>6555_84<>chien-tsai liu:panos k. chrysanthis<>database schema evolution through the specification and maintenance of changes on entities and relationships<>er<>shi-kuo chang<>
12076<>6557_19<>stephen taylor<>a compiler approach to scalable concurrent-program design<>toplas<>ian t. foster<>
21810<>6562_0<>grant e. weddell<>implication problems for functional constraints on databases supporting complex objects<>jcss<>minoru ito<>
40817<>6579_2<>trung n. nguyen:farnaz mounes-toussi:david j. lilja<>a compiler-assisted scheme for adaptive cache coherence enforcement<>ifipPACT<>zhiyuan li<>
40843<>6579_28<>nulo<>software assistance for directory-based caches<>ipps<>zhiyuan li<>
1325<>6584_39<>edward y. chang:zohar manna<>compositional verification of real-time systems<>lics<>amir pnueli<>
1329<>6584_43<>doron peled<>proving partial order properties<>tcs<>amir pnueli<>
1384<>6584_98<>eugene asarin:oded maler<>symbolic controller synthesis for discrete and timed systems<>hybrid<>amir pnueli<>
1408<>6584_122<>zohar manna<>temporal verification diagrams<>tacs<>amir pnueli<>
1409<>6584_123<>thomas a. henzinger:zohar manna<>temporal proof methodologies for timed transition systems<>iandc<>amir pnueli<>
4837<>6619_0<>wenping wang:barry joe<>on the difference method for drawing conic arcs<>cvgip<>c. y. wang<>
31622<>6631_0<>kit po wong<>development of parallel hybrid optimisation techniques based on genetic algorithms and simulated annealing<>evoW<>s. yin wa wong<>
31623<>6631_1<>kit po wong<>development of hybrid optimisation techniques based on genetic algorithms and simulated annealing<>evoW<>s. yin wa wong<>
19795<>6651_0<>kyoji umemura<>construction of a bilingual dictionary intermediated by a third language<>coling<>kumiko tanaka<>
41407<>6669_0<>josep torrellas<>the performance of the cedar multistage switching network<>sc<>zheng zhang<>
41447<>6673_8<>donald f. towsley:james f. kurose<>statistical analysis of generalized processor sharing scheduling discipline<>sigcomm<>zhi-li zhang<>
3673<>6675_9<>c. a. middelburg<>a typed logic of partial functions reconstructed classically<>acta<>cliff b. jones<>
3701<>6676_7<>douglas tudhope:paul beynon-davies:carl taylor<>virtual architecture based on a binary relational model: a museum hypermedia application<>hm<>chris jones<>
1869<>6684_6<>herbert edelsbrunner:leonidas j. guibas:john hershberger:raimund seidel:micha sharir<>selecting heavily covered points<>siamcomp<>bernard chazelle<>
1885<>6684_22<>hervo bronnimann<>optimal slope selection via cuttings<>cccg<>bernard chazelle<>
1892<>6684_29<>joel friedman<>point location among hyperplanes and unidirectional ray-shooting<>comgeo<>bernard chazelle<>
1930<>6684_67<>nulo<>a spectral approach to lower bounds<>focs<>bernard chazelle<>
1953<>6684_90<>nulo<>computational geometry: a retrospective<>stoc<>bernard chazelle<>
1956<>6684_93<>herbert edelsbrunner:michelangelo grigni:leonidas j. guibas:john hershberger:micha sharir:jack snoeyink<>ray shooting in polygons using geodesic triangulations<>algorithmica<>bernard chazelle<>
1958<>6684_95<>reuven bar-yehuda<>triangulating disjoint jordan chains<>ijcga<>bernard chazelle<>
1975<>6684_112<>nadia shouraboura<>bounds on the size of tetrahedralizations<>compgeom<>bernard chazelle<>
6656<>6719_15<>guy kortsarz<>generating sparse 2-spanners<>jal<>david peleg<>
3333<>6743_1<>laurens r. leerink:bill g. horne:marwan a. jabri<>learning with product units<>nips<>c. lee giles<>
3346<>6743_14<>bill g. horne<>an experimental comparison of recurrent neural networks<>nips<>c. lee giles<>
3358<>6743_26<>kam-chuen jim:bill g. horne<>effects of noise on convergence and generalization in recurrent networks<>nips<>c. lee giles<>
29768<>6748_5<>david n. c. tse<>a paradigm for class identification problems<>tit<>s. r. kulkarni<>
29785<>6748_22<>r. m. dudley:t. j. richardson:ofer zeitouni<>a metric entropy bound is not sufficient for learnability<>tit<>sanjeev r. kulkarni<>
19347<>6761_20<>sarah a. rajala<>generalized optimum dynamic bit allocation scheme for source compression<>icip<>kai-kuang ma<>
19349<>6762_0<>huishan zhou:jianqin zhou<>on the ascending star subgraph decomposition of star forests<>combinatorica<>kejie ma<>
40791<>6771_6<>peter van emde boas<>information acquisition from multi-agent resources<>tark<>zhisheng huang<>
755<>6789_7<>thomas g. dietterich:richard h. lathrop:david chapman:roger e. critchlow jr.:barr e. bauer:teresa a. webster:tomes lozano-perez<>compass: a shape-based machine learning tool for drug design<>jcamd<>ajay n. jain<>
11599<>6800_2<>robert k. brayton<>permissible observability relations in fsm networks<>dac<>huey-yih wang<>
5638<>6804_18<>michael j. carey:michael j. franklin:nancy e. hall:mark l. mcauliffe:jeffrey f. naughton:daniel t. schuh:marvin h. solomon:c. k. tan:odysseas g. tsatalos:seth j. white:michael j. zwilling<>shoring up persistent applications<>sigmod<>david j. dewitt<>
5643<>6804_23<>seth j. white<>quickstore: a high performance mapped object store<>sigmod<>david j. dewitt<>
5647<>6804_27<>navin kabra:jun luo:jignesh m. patel:jie-bing yu<>client-server paradise<>vldb<>david j. dewitt<>
21197<>6805_1<>gabriele paul<>logic-based plan recognition for intelligent help systems<>puk<>mathias bauer<>
19<>6828_8<>kassem saleh:imtiaz ahmad:khaled al-saqabi<>an efficient recovery procedure for fault tolerance in distributed systems<>jss<>anjali agarwal<>
9097<>6829_0<>a. kapsalis:victor j. rayward-smith<>a unified paradigm for parallel genetic algorithms<>aisb<>g. d. smith<>
9075<>6831_10<>nulo<>an object-oriented development framework for z<>zum<>graeme smith<>
9086<>6831_21<>nicole levy<>a language-independent approach to specification construction<>sigsoft<>g. smith<>
9096<>6831_31<>nulo<>a development framework for object-oriented specification and refinement<>tools<>graeme smith<>
7363<>6859_0<>tom kong<>parametric interpolator versus linear interpolator for precision cnc machining<>cad<>daniel c. h. yang<>
5162<>6877_6<>jeffrey j. rodriguez<>effects of luminance quantization error on color image processing<>tip<>christopher c. yang<>
5148<>6880_5<>jau-hsiung huang<>a real-time synchronization model and transport protocol for multimedia applications<>infocom<>chun-chuan yang<>
2339<>6889_26<>nulo<>library design<>tools<>bertrand meyer<>
2359<>6889_46<>nulo<>on the role of methodology: advice to the advisors<>coodbse<>bertrand meyer<>
17019<>6903_16<>jyh-han lin<>a theory for memory-based learning<>ml<>jeffrey scott vitter<>
17042<>6903_39<>paul g. howard<>design and analysis of fast text compression based on quasi-arithmetic coding<>ipm<>jeffrey scott vitter<>
17077<>6903_74<>yossi matias:neal e. young<>approximate data structures with applications<>soda<>jeffrey scott vitter<>
17079<>6903_76<>p. krishnan<>optimal prediction for prefetching in the worst case<>soda<>jeffrey scott vitter<>
17082<>6903_79<>elizabeth a. m. shriver<>algorithms for parallel memory ii: hierarchical multilevel memories<>algorithmica<>jeffrey scott vitter<>
17086<>6903_83<>dzung t. hoang:philip m. long<>explicit bit minimization for motion-compensated video coding<>dcc<>jeffrey scott vitter<>
17092<>6903_89<>elizabeth a. m. shriver<>algorithms for parallel memory i: two-level memories<>algorithmica<>jeffrey scott vitter<>
17097<>6903_94<>peter bro miltersen:sairam subramanian:roberto tamassia<>complexity models for incremental computation<>tcs<>jeffrey scott vitter<>
