Sciweavers

498 search results - page 23 / 100
» A Theory of Complexity for Continuous Time Systems
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 8 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
GRAPHICSINTERFACE
2003
13 years 8 months ago
Interactive Point-based Modeling of Complex Objects from Images
Modeling complex realistic objects is a difficult and time consuming process. Nevertheless, with improvements in rendering speed and quality, more and more applications require s...
Pierre Poulin, Marc Stamminger, François Du...
ICRA
2002
IEEE
146views Robotics» more  ICRA 2002»
14 years 9 days ago
Real-Time Combinatorial Tracking of a Target Moving Unpredictably among Obstacles
Abstract—Many applications require continuous monitoring of a moving target by a controllable vision system. Although the goal of tracking objects is not new, traditional techniq...
Héctor H. González-Baños, Che...
INFOCOM
2011
IEEE
12 years 11 months ago
Understanding robustness of mobile networks through temporal network measures
—The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account ...
Salvatore Scellato, Ilias Leontiadis, Cecilia Masc...
AML
2011
204views Mathematics» more  AML 2011»
13 years 2 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek