Sciweavers

2911 search results - page 393 / 583
» A Logic of Graph Constraints
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ISSRE
2006
IEEE
16 years 16 days ago
BPEL4WS Unit Testing: Test Case Generation Using a Concurrent Path Analysis Approach
BPEL is a language that could express complex concurrent behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. Th...
Jun Yan, Zhong Jie Li, Yuan Yuan, Wei Sun, Jian Zh...
GEOS
2009
Springer
15 years 11 months ago
SPARQL Query Re-writing Using Partonomy Based Transformation Rules
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
Prateek Jain, Peter Z. Yeh, Kunal Verma, Cory A. H...
CP
2000
Springer
15 years 11 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
15 years 10 months ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata