Sciweavers

1132 search results - page 119 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
Karine Altisen, Yanhong Liu, Matthieu Moy
TIT
2010
87views Education» more  TIT 2010»
15 years 1 months ago
Silence-based communication
We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worstcase complexities of ...
Anand K. Dhulipala, Christina Fragouli, Alon Orlit...
ICCV
2009
IEEE
1119views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Spectral clustering of linear subspaces for motion segmentation
This paper studies automatic segmentation of multiple motions from tracked feature points through spectral embedding and clustering of linear subspaces. We show that the dimensi...
Fabien Lauer, Christoph Schn¨orr
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 3 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
FOCS
2009
IEEE
16 years 1 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...