Sciweavers

617 search results - page 93 / 124
» On the Chromatic Number of Random Graphs
Sort
View
JDWM
2010
180views more  JDWM 2010»
15 years 2 months ago
Investigating the Properties of a Social Bookmarking and Tagging Network
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
Ralitsa Angelova, Marek Lipczak, Evangelos E. Mili...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 4 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
ICIP
2008
IEEE
15 years 10 months ago
Regularized depth from defocus
In the area of depth estimation from images an interesting approach has been structure recovery from defocus cue. Towards this end, there have been a number of approaches [4, 6]. ...
Vinay P. Namboodiri, Subhasis Chaudhuri, Sunil Had...
ISCIS
2004
Springer
15 years 9 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
TIT
2010
107views Education» more  TIT 2010»
14 years 11 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali