Sciweavers

976 search results - page 75 / 196
» The Complexity of Timetable Construction Problems
Sort
View
MICAI
2004
Springer
14 years 2 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
COMPGEOM
2008
ACM
13 years 10 months ago
Arrangements of geodesic arcs on the sphere
This movie illustrates exact construction and maintenance of arrangements induced by arcs of great circles embedded on the sphere, also known as geodesic arcs, and exact computati...
Efi Fogel, Ophir Setter, Dan Halperin
AAAI
1996
13 years 10 months ago
Evolution-Based Discovery of Hierarchical Behaviors
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...
Justinian P. Rosca, Dana H. Ballard
JMLR
2008
117views more  JMLR 2008»
13 years 9 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
ISPEC
2007
Springer
14 years 3 months ago
Privacy-Preserving Credentials Upon Trusted Computing Augmented Servers
Credentials are an indispensable means for service access control in electronic commerce. However, regular credentials such as X.509 certificates and SPKI/SDSI certificates do no...
Yanjiang Yang, Robert H. Deng, Feng Bao