Sciweavers

1414 search results - page 178 / 283
» Randomness and Universal Machines
Sort
View
COLT
2001
Springer
15 years 8 months ago
Limitations of Learning via Embeddings in Euclidean Half-Spaces
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
151
Voted
BMCBI
2008
163views more  BMCBI 2008»
15 years 3 months ago
i-SEGOPubmed: a web interface for semantic enabled browsing of PubMed using Gene Ontology
imately 20 million abstracts. Browsing such a huge repository to find relevant information as well as providing elearning service requires new generation of interfaces. Methods suc...
Mohammed Yeasin, Bhanu Vanteru, Jahangheer S. Shai...
152
Voted
AC
1998
Springer
15 years 3 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 3 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 3 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah