Sciweavers

6756 search results - page 1061 / 1352
» The Structure of Visual Spaces
Sort
View
STACS
2007
Springer
16 years 25 days ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
HICSS
2006
IEEE
98views Biometrics» more  HICSS 2006»
16 years 23 days ago
Electricity Markets: How Many, Where and When?
Most markets compromise the economist’s ideal of matching the marginal benefits to consumers with the marginal cost of supply for incremental purchases because individual buyers...
Nodir Adilov, Richard E. Schuler
ICNP
2006
IEEE
16 years 23 days ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
INFOCOM
2006
IEEE
16 years 23 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
INFOCOM
2006
IEEE
16 years 23 days ago
Scalable Clustering of Internet Paths by Shared Congestion
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....
« Prev « First page 1061 / 1352 Last » Next »