Sciweavers

1162 search results - page 230 / 233
» Specifying Reusable Components
Sort
View
TIFS
2008
157views more  TIFS 2008»
14 years 9 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
BMCBI
2004
144views more  BMCBI 2004»
14 years 9 months ago
PASBio: predicate-argument structures for event extraction in molecular biology
Background: The exploitation of information extraction (IE), a technology aiming to provide instances of structured representations from free-form text, has been rapidly growing w...
Tuangthong Wattarujeekrit, Parantu K. Shah, Nigel ...
CCR
2004
90views more  CCR 2004»
14 years 9 months ago
A constraint satisfaction approach to testbed embedding services
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
Jeffrey Considine, John W. Byers, Ketan Meyer-Pate...
CORR
2004
Springer
151views Education» more  CORR 2004»
14 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
DATAMINE
2002
147views more  DATAMINE 2002»
14 years 9 months ago
Discretization: An Enabling Technique
Discrete values have important roles in data mining and knowledge discovery. They are about intervals of numbers which are more concise to represent and specify, easier to use and ...
Huan Liu, Farhad Hussain, Chew Lim Tan, Manoranjan...