Sciweavers

4843 search results - page 958 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
82
Voted
TKDE
2008
171views more  TKDE 2008»
14 years 9 months ago
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
Lei Chen 0002, Xiang Lian
BMCBI
2005
151views more  BMCBI 2005»
14 years 9 months ago
ProMiner: rule-based protein and gene entity recognition
Background: Identification of gene and protein names in biomedical text is a challenging task as the corresponding nomenclature has evolved over time. This has led to multiple syn...
Daniel Hanisch, Katrin Fundel, Heinz-Theodor Mevis...
CG
2005
Springer
14 years 9 months ago
Adaptive density estimation using an orthogonal series for global illumination
In Monte-Carlo photon-tracing methods energy-carrying particles are traced in an environment to generate hit points on object surfaces for simulating global illumination. The surf...
Kam Wah Wong, Wenping Wang
TSP
2008
101views more  TSP 2008»
14 years 9 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
AI
2002
Springer
14 years 9 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...