Sciweavers

24095 search results - page 4510 / 4819
» Researchers and Development - Young Researches
Sort
View
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 11 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
ATAL
2000
Springer
15 years 11 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
ECCV
2010
Springer
15 years 11 months ago
Hough Transform and 3D SURF for robust three dimensional classification
Most methods for the recognition of shape classes from 3D datasets focus on classifying clean, often manually generated models. However, 3D shapes obtained through acquisition tech...
ICPR
2010
IEEE
15 years 11 months ago
Detecting Altered Fingerprints
Abstract--The widespread deployment of Automated Fingerprint Identification Systems (AFIS) in law enforcement and border control applications has heightened the need for ensuring t...
Jianjiang Feng, Anil Jain, Arun Ross
DDEP
2000
Springer
15 years 11 months ago
Context-Aware Digital Documents Described in a High-Level Petri Net-Based Hypermedia System
As mobile computing becomes widespread, so will the need for digital document delivery by hypertextual means. A further trend will be the provision of the ability for devices to de...
Jin-Cheon Na, Richard Furuta
« Prev « First page 4510 / 4819 Last » Next »