Sciweavers

959 search results - page 121 / 192
» Possible and Necessary h-Indices
Sort
View
COMPGEOM
2001
ACM
13 years 11 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
MICCAI
2000
Springer
13 years 11 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly
SP
1997
IEEE
139views Security Privacy» more  SP 1997»
13 years 11 months ago
Number Theoretic Attacks on Secure Password Schemes
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
Sarvar Patel
UML
1997
Springer
13 years 11 months ago
Evaluation of Object-Oriented Modelling Languages: A Comparison Between OML and UML
The following article is motivated by the current efforts of the Object Management Group (OMG) to standardize object-oriented modelling languages. In the face of the great economi...
Michael Prasse
ICDE
1991
IEEE
175views Database» more  ICDE 1991»
13 years 11 months ago
Constraint-Based Reasoning in Deductive Databases
— Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investi...
Jiawei Han