Sciweavers

3356 search results - page 102 / 672
» Determining Consensus Numbers
Sort
View
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
13 years 9 months ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
PODC
2009
ACM
14 years 9 months ago
Brief announcement: collaborative measurement of upload speeds in P2P systems
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
John R. Douceur, James W. Mickens, Thomas Moscibro...
CSE
2009
IEEE
14 years 3 months ago
Localization of Shipping Containers in Ports and Terminals Using Wireless Sensor Networks
The most advanced logistics solutions that are currently adopted in ports and terminals use RFID- and GPS-based technologies to identify and localize shipping containers in the ya...
Stefano Abbate, Marco Avvenuti, Paolo Corsini, Ale...
ICMCS
1999
IEEE
135views Multimedia» more  ICMCS 1999»
14 years 1 months ago
Time-Constrained Keyframe Selection Technique
In accessing large collections of digitized videos, it is often difficult to find both the appropriate video file and the portion of the video that is of interest. This paper descr...
Andreas Girgensohn, John S. Boreczky
CGI
1998
IEEE
14 years 1 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...