Sciweavers

1265 search results - page 143 / 253
» Algorithms for Drawing Media
Sort
View
135
Voted
COMGEO
2011
ACM
14 years 11 months ago
A computational approach to Conway's thrackle conjecture
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
Radoslav Fulek, János Pach
127
Voted
SENSYS
2009
ACM
15 years 10 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
147
Voted
INFOCOM
1998
IEEE
15 years 8 months ago
Timer Reconsideration for Enhanced RTP Scalability
RTP, the Real Time Transport Protocol, has gained widespread acceptance as the transport protocol for voice and video on the Internet. Its companion control protocol, the Real Tim...
Jonathan Rosenberg, Henning Schulzrinne
107
Voted
ICML
2007
IEEE
16 years 4 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
DCC
2005
IEEE
16 years 3 months ago
The Markov Expert for Finding Episodes in Time Series
We describe a domain-independent, unsupervised algorithm for refined segmentation of time series data into meaningful episodes, focusing on the problem of text segmentation. The V...
Jimming Cheng, Michael Mitzenmacher