4913 search results - page 927 / 983 » Results and Perspectives of the G |
152
click to vote
STOC
2000
ACM
15 years 5 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
141
Voted
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
98
Voted
CIKM
2000
Springer
15 years 5 months ago
2000
Springer
Large collections of documents containing various types of multimedia, are made available to the WWW. Unfortunately, due to the un-structuredness of Internet environments it is ha...
120
Voted
CGO
2010
IEEE
15 years 5 months ago
2010
IEEE
To improve the performance of transactional memory (TM), researchers have found many eager and lazy optimizations for conflict detection, the process of determining if transaction...
97
Voted
CODES
1999
IEEE
15 years 5 months ago
1999
IEEE
o much higher levels of abstraction than today's design practices, which are usually at the level of synthesizable RTL for custom hardware or Instruction Set Simulator (ISS) f...