Sciweavers

15375 search results - page 209 / 3075
» cans 2008
Sort
View
CPC
2004
136views more  CPC 2004»
13 years 8 months ago
On the Strong Chromatic Number
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
Penny E. Haxell
CVIU
2004
131views more  CVIU 2004»
13 years 8 months ago
Part-level object recognition using superquadrics
This paper proposes a technique for object recognition using superquadric built models. Superquadrics, which are three-dimensional models suitable for part-level representation of...
Jaka Krivic, Franc Solina
CACM
2000
97views more  CACM 2000»
13 years 8 months ago
Generalizing by Removing Detail
A long-standing goal of the programming by demonstration research community is to enable people to construct programs by showing how the desired programs should work on sample inp...
Kenneth M. Kahn
CN
2000
92views more  CN 2000»
13 years 8 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
CLEIEJ
2002
113views more  CLEIEJ 2002»
13 years 8 months ago
Analysis Patterns for GIS Data Schema Reuse on Urban Management Applications
An analysis pattern is any part of a requirement analysis specification that can be reused in the design of other information systems as well. Urban management systems (e.g.: Tax ...
Jugurta Lisboa Filho, Cirano Iochpe, Karla A. V. B...