Sciweavers

1999 search results - page 179 / 400
» Finding Reductions Automatically
Sort
View
IPM
2008
92views more  IPM 2008»
15 years 1 months ago
Searching strategies for the Hungarian language
This paper reports on the underlying IR problems encountered when dealing with the complex morphology and compound constructions found in the Hungarian language. It describes evalu...
Jacques Savoy
JAR
2000
97views more  JAR 2000»
15 years 1 months ago
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang
CIKM
2008
Springer
15 years 3 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
ICIP
2009
IEEE
16 years 2 months ago
Palmprint Verification Using Consistent Orientation Coding
Developing accurate and robust palmprint verification algorithms is one of the key issues in automatic palmprint recognition systems. Recently, orientation based coding algorithms...
WWW
2008
ACM
16 years 2 months ago
Computable social patterns from sparse sensor data
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
Dinh Q. Phung, Brett Adams, Svetha Venkatesh