Sciweavers

20066 search results - page 3832 / 4014
» T Spaces
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 8 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
PEWASUN
2007
ACM
15 years 8 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
TRECVID
2008
15 years 8 months ago
National Institute of Informatics, Japan at TRECVID 2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...
Duy-Dinh Le, Xiaomeng Wu, Shin'ichi Satoh, Sheetal...
RSS
2007
135views Robotics» more  RSS 2007»
15 years 8 months ago
Learning omnidirectional path following using dimensionality reduction
Abstract— We consider the task of omnidirectional path following for a quadruped robot: moving a four-legged robot along any arbitrary path while turning in any arbitrary manner....
J. Zico Kolter, Andrew Y. Ng
« Prev « First page 3832 / 4014 Last » Next »