Sciweavers

329 search results - page 19 / 66
» Probably Approximately Correct Learning
Sort
View
IJCAI
1989
13 years 8 months ago
An Experimental Comparison of Symbolic and Connectionist Learning Algorithms
Despite the fact that many symbolic and connectionist (neural net) learning algorithms are addressing the same problem of learning from classified examples, very little Is known r...
Raymond J. Mooney, Jude W. Shavlik, Geoffrey G. To...
TSP
2012
12 years 3 months ago
Sensing and Probing Cardinalities for Active Cognitive Radios
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, ...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 8 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
13 years 12 months ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
POPL
2007
ACM
14 years 7 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic