Sciweavers

166 search results - page 24 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
FOCS
1991
IEEE
14 years 4 days ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 10 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
IPSN
2005
Springer
14 years 2 months ago
Maximizing system lifetime in wireless sensor networks
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
Qunfeng Dong
CVPR
2009
IEEE
15 years 1 months ago
Tracking of a Non-Rigid Object via Patch-based Dynamic Appearance Modeling and Adaptive Basin Hopping Monte Carlo Sampling
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
Junseok Kwon (Seoul National University), Kyoung M...
IANDC
2006
101views more  IANDC 2006»
13 years 8 months ago
Mind change efficient learning
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
Wei Luo, Oliver Schulte