Sciweavers

2252 search results - page 97 / 451
» Improving Random Forests
Sort
View
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
14 years 1 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
14 years 2 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
FLAIRS
2004
13 years 9 months ago
A Method Based on RBF-DDA Neural Networks for Improving Novelty Detection in Time Series
Novelty detection in time series is an important problem with application in different domains such as machine failure detection, fraud detection and auditing. An approach to this...
Adriano L. I. Oliveira, Fernando Buarque de Lima N...