Sciweavers

970 search results - page 71 / 194
» Query by tapping system based on alignment algorithm
Sort
View
ESCIENCE
2006
IEEE
15 years 8 months ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
ICDE
1994
IEEE
87views Database» more  ICDE 1994»
15 years 6 months ago
Implementing Calendars and Temporal Rules in Next Generation Databases
In applications like nancial trading, scheduling, manufacturing and process control, time based predicates in queries and rules are very important. There is also a need to de ne ...
Rakesh Chandra, Arie Segev, Michael Stonebraker
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
16 years 3 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
CORR
2011
Springer
185views Education» more  CORR 2011»
14 years 9 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
149
Voted
3DIM
2007
IEEE
15 years 8 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...