Sciweavers

3208 search results - page 639 / 642
» A Lower Bound for Primality
Sort
View
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 2 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
MACOM
2010
13 years 2 months ago
On the Performance of Single LDGM Codes for Iterative Data Fusion over the Multiple Access Channel
One of the applications of wireless sensor networks currently undergoing active research focuses on the scenario where the information generated by a data source S is simultaneousl...
Javier Del Ser, Javier Garcia-Frias, Pedro M. Cres...
SIAMDM
2010
167views more  SIAMDM 2010»
13 years 2 months ago
Domination Game and an Imagination Strategy
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall