Sciweavers

7167 search results - page 545 / 1434
» Answer Set Programming
Sort
View
ICALP
2009
Springer
16 years 5 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
ICS
2009
Tsinghua U.
15 years 11 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
UM
2007
Springer
15 years 11 months ago
The Effect of Model Granularity on Student Performance Prediction Using Bayesian Networks
A standing question in the field of Intelligent Tutoring Systems and User Modeling in general is what is the appropriate level of model granularity (how many skills to model) and h...
Zachary A. Pardos, Neil T. Heffernan, Brigham Ande...
ICALP
2004
Springer
15 years 10 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
KI
2004
Springer
15 years 10 months ago
SmartWeb: Mobile Applications of the Semantic Web
Abstract Recent progress in mobile broadband communication and semantic web technology is enabling innovative internet services that provide advanced personalization and localizati...
Wolfgang Wahlster