Sciweavers

1688 search results - page 226 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ICTAI
2003
IEEE
15 years 4 months ago
Extracting Biochemical Interactions from MEDLINE Using a Link Grammar Parser
Many natural language processing approaches at various complexity levels have been reported for extracting biochemical interactions from MEDLINE. While some algorithms using simpl...
Jing Ding, Daniel Berleant, Jun Xu, Andy W. Fulmer
GRID
2003
Springer
15 years 4 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 4 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
CIVR
2010
Springer
254views Image Analysis» more  CIVR 2010»
15 years 4 months ago
Video scene analysis of interactions between humans and vehicles using event context
In this paper, we present a methodology to estimate a detailed state of a video scene involving multiple humans and vehicles. In order to annotate and retrieve videos containing a...
M. S. Ryoo, Jong Taek Lee, Jake K. Aggarwal
COLT
2001
Springer
15 years 3 months ago
Smooth Boosting and Learning with Malicious Noise
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
Rocco A. Servedio