Sciweavers

24444 search results - page 4739 / 4889
» A Data Model for Data Integration
Sort
View
ICCS
2001
Springer
15 years 8 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
IWDC
2001
Springer
140views Communications» more  IWDC 2001»
15 years 8 months ago
Satellite Systems Performance with TCP-IP Applications
Mobile Internet access is becoming extremely popular because users depend on the Internet for many activities in their daily routine. Satellites are well suited for mobile Interne...
Pierpaolo Loreti, Michele Luglio, Rohit Kapoor, J....
VLDB
2001
ACM
190views Database» more  VLDB 2001»
15 years 8 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
SIGGRAPH
2000
ACM
15 years 8 months ago
Style machines
We approach the problem of stylistic motion synthesis by learning motion patterns from a highly varied set of motion capture sequences. Each sequence may have a distinct choreogra...
Matthew Brand, Aaron Hertzmann
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 8 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
« Prev « First page 4739 / 4889 Last » Next »