Sciweavers

9842 search results - page 243 / 1969
» Problem complexity
Sort
View
CVPR
2006
IEEE
16 years 18 days ago
Joint Recognition of Complex Events and Track Matching
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...
Michael T. Chan, Anthony Hoogs, Rahul Bhotika, A. ...
MKWI
2008
190views Business» more  MKWI 2008»
15 years 8 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
BMCBI
2004
93views more  BMCBI 2004»
15 years 6 months ago
Predicting binding sites of hydrolase-inhibitor complexes by combining several methods
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
ADMA
2006
Springer
127views Data Mining» more  ADMA 2006»
16 years 16 days ago
Feature Selection for Complex Patterns
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...
Peter Schenkel, Wanqing Li, Wanquan Liu
GLOBECOM
2007
IEEE
16 years 26 days ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu