Sciweavers

1897 search results - page 358 / 380
» Sparse Additive Machine
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 4 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
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...
Avrim Blum, Adam Kalai, Hal Wasserman
110
Voted
AGENTS
2000
Springer
15 years 4 months ago
Automated assistants to aid humans in understanding team behaviors
Multi-agent teamwork is critical in a large number of agent applications, including training, education, virtual enterprises and collective robotics. Tools that can help humans an...
Taylor Raines, Milind Tambe, Stacy Marsella
CANPC
2000
Springer
15 years 4 months ago
Transparent Network Connectivity in Dynamic Cluster Environments
Improvements in microprocessor and networking performance have made networks of workstations a very attractive platform for high-end parallel and distributed computing. However, t...
Xiaodong Fu, Hua Wang, Vijay Karamcheti
109
Voted
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 4 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
15 years 4 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose