Sciweavers

44651 search results - page 8567 / 8931
» Generalized
Sort
View
MST
2006
104views more  MST 2006»
15 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
MST
2006
136views more  MST 2006»
15 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
PAMI
2008
152views more  PAMI 2008»
15 years 7 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
PAMI
2008
183views more  PAMI 2008»
15 years 7 months ago
Shape-and-Behavior Encoded Tracking of Bee Dances
Behavior analysis of social insects has garnered impetus in recent years and has led to some advances in fields like control systems, flight navigation etc. Manual labeling of ins...
Ashok Veeraraghavan, Rama Chellappa, Mandyam Srini...
IANDC
2007
107views more  IANDC 2007»
15 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
« Prev « First page 8567 / 8931 Last » Next »