Sciweavers

2395 search results - page 424 / 479
» A comparative study of two object recognition methods
Sort
View
NHM
2010
87views more  NHM 2010»
14 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
EUROSSC
2009
Springer
15 years 4 months ago
Time-Lag as Limiting Factor for Indoor Walking Navigation
Several navigation situations can be imagined where visual cueing is not practical or unfeasible, and where the hands are required exclusively for a certain task. The utilization o...
Andreas Riener, Markus Straub, Alois Ferscha
SIGMOD
2004
ACM
164views Database» more  SIGMOD 2004»
15 years 10 months ago
Dynamic Plan Migration for Continuous Queries Over Data Streams
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
Yali Zhu, Elke A. Rundensteiner, George T. Heinema...
PROMISE
2010
14 years 4 months ago
Better, faster, and cheaper: what is better software?
Background: Defects are related to failures and they do not have much power for indicating a higher quality or a better system above the baseline that the end-users expect. Nevert...
Burak Turhan, Çetin Meriçli, Tekin M...
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal