Sciweavers

5592 search results - page 1004 / 1119
» On Random Betweenness Constraints
Sort
View
DCC
2007
IEEE
16 years 4 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
117
Voted
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 2 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
137
Voted
ICCAD
2004
IEEE
147views Hardware» more  ICCAD 2004»
16 years 1 months ago
Interval-valued reduced order statistical interconnect modeling
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
James D. Ma, Rob A. Rutenbar
146
Voted
IUI
2010
ACM
16 years 1 months ago
A POMDP approach to P300-based brain-computer interfaces
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
Jaeyoung Park, Kee-Eung Kim, Sungho Jo
177
Voted
WWW
2010
ACM
15 years 11 months ago
Automatic extraction of clickable structured web contents for name entity queries
Today the major web search engines answer queries by showing ten result snippets, which need to be inspected by users for identifying relevant results. In this paper we investigat...
Xiaoxin Yin, Wenzhao Tan, Xiao Li, Yi-Chin Tu
« Prev « First page 1004 / 1119 Last » Next »