Sciweavers

2310 search results - page 352 / 462
» Coloring Random Graphs
Sort
View
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
JSAC
2011
116views more  JSAC 2011»
13 years 2 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
CVPR
2008
IEEE
14 years 10 months ago
Learning for stereo vision using the structured support vector machine
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
Yunpeng Li, Daniel P. Huttenlocher
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 9 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 2 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara