Sciweavers

339 search results - page 57 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
EUROPAR
2009
Springer
14 years 7 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
PVLDB
2008
100views more  PVLDB 2008»
14 years 9 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
75
Voted
RECOMB
2007
Springer
15 years 10 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
INFOCOM
2010
IEEE
14 years 8 months ago
Compressive Oversampling for Robust Data Transmission in Sensor Networks
—Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensin...
Zainul Charbiwala, Supriyo Chakraborty, Sadaf Zahe...
ICDCS
2002
IEEE
15 years 2 months ago
A Practical Approach for ?Zero? Downtime in an Operational Information System
An Operational Information System (OIS) supports a real-time view of an organization’s information critical to its logistical business operations. A central component of an OIS ...
Ada Gavrilovska, Karsten Schwan, Van Oleson