Sciweavers

16883 search results - page 380 / 3377
» Generalized Non-Reducible Descriptors
Sort
View
SIGIR
2005
ACM
16 years 11 days ago
A Markov random field model for term dependencies
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as eviden...
Donald Metzler, W. Bruce Croft
SPAA
2005
ACM
16 years 11 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
ATAL
2005
Springer
16 years 11 days ago
Progressive ontology alignment for meaning coordination: an information-theoretic foundation
We elaborate on the mathematical foundations of the meaning coordination problem that agents face in open environments. We investigate to which extend the BarwiseSeligman theory o...
W. Marco Schorlemmer, Yannis Kalfoglou
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
16 years 10 days ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
DOLAP
2004
ACM
16 years 7 days ago
Developing a characterization of business intelligence workloads for sizing new database systems
Computer system sizing involves estimating the amount of hardware resources needed to support a new workload not yet deployed in a production environment. In order to determine th...
Ted J. Wasserman, Patrick Martin, David B. Skillic...