Sciweavers

2192 search results - page 186 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICCV
2007
IEEE
16 years 6 months ago
Fast Crowd Segmentation Using Shape Indexing
This paper presents a fast, accurate, and novel method for the problem of estimating the number of humans and their positions from background differenced images obtained from a si...
Lan Dong, Vasu Parameswaran, Visvanathan Ramesh, I...
ATAL
2009
Springer
15 years 11 months ago
From DPS to MAS to ...: continuing the trends
The most important and interesting of the computing challenges we are facing are those that involve the problems and opportunities afforded by massive decentralization and disinte...
Michael N. Huhns
254
Voted
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 4 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 7 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
15 years 9 months ago
Investigating whether hyperNEAT produces modular neural networks
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
Jeff Clune, Benjamin E. Beckmann, Philip K. McKinl...