Sciweavers

5138 search results - page 656 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CCS
2010
ACM
15 years 5 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 1 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
TIP
2010
176views more  TIP 2010»
15 years 1 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
TSP
2010
15 years 1 months ago
Linear precoder design through cut-off rate maximization in MIMO-OFDM coded systems with imperfect CSIT
This paper proposes a linear transmitter design that aims at minimizing the packet error rate (PER) using partial channel state information at the transmitter (CSIT). The design is...
Francesc Rey, Meritxell Lamarca, Gregori Vá...
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
16 years 6 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...