Sciweavers

4539 search results - page 506 / 908
» Approaches to Compute Workflow Complexity
Sort
View
183
Voted
NLDB
2005
Springer
16 years 8 days ago
On Some Optimization Heuristics for Lesk-Like WSD Algorithms
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
SCIA
2005
Springer
186views Image Analysis» more  SCIA 2005»
16 years 8 days ago
Building Detection from Mobile Imagery Using Informative SIFT Descriptors
We propose reliable outdoor object detection on mobile phone imagery from off-the-shelf devices. With the goal to provide both robust object detection and reduction of computation...
Gerald Fritz, Christin Seifert, Manish Kumar, Luca...
195
Voted
GRID
2003
Springer
16 years 6 hour 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
EICS
2010
ACM
15 years 12 months ago
Self-explanatory user interfaces by model-driven engineering
Modern User Interfaces (UI) must deal with the increasing complexity of applications as well as new features such as the capacity of UIs to be dynamically adapted to the context o...
Alfonso García Frey
CSL
2001
Springer
15 years 11 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
Frédéric Koriche