Sciweavers

3040 search results - page 572 / 608
» Independent Natural Extension
Sort
View
SIGIR
2006
ACM
14 years 4 months ago
Semantic term matching in axiomatic approaches to information retrieval
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...
Hui Fang, ChengXiang Zhai
VRCAI
2006
ACM
14 years 4 months ago
Parallel-split shadow maps for large-scale virtual environments
Shadowing effects dramatically enhance the realism of virtual environments by providing useful visual cues. Shadow mapping is an efficient algorithm for real-time shadow renderin...
Fan Zhang, Hanqiu Sun, Leilei Xu, Lee Kit Lun
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 3 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
BTW
2005
Springer
142views Database» more  BTW 2005»
14 years 3 months ago
Self-Extending Peer Data Management
Abstract: Peer data management systems (PDMS) are the natural extension of integrated information systems. Conventionally, a single integrating system manages an integrated schema,...
Ralf Heese, Sven Herschel, Felix Naumann, Armin Ro...
CP
2005
Springer
14 years 3 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell