Sciweavers

634 search results - page 111 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
CVPR
2005
IEEE
2143views Computer Vision» more  CVPR 2005»
15 years 4 months ago
Level Set Evolution Without Re-initialization: A New Variational Formulation
"In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and theref...
Chunming Li, Chenyang Xu, Changfeng Gui, and Marti...
CVPR
2008
IEEE
14 years 10 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
ICML
2007
IEEE
14 years 9 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
SIGSOFT
2007
ACM
14 years 9 months ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
SIGSOFT
2001
ACM
14 years 9 months ago
Detecting implied scenarios in message sequence chart specifications
Scenario-based specifications such as Message Sequence Charts (MSCs) are becoming increasingly popular as part of a requirements specification. Scenarios describe how system compo...
Jeff Kramer, Jeff Magee, Sebastián Uchitel