Sciweavers

3775 search results - page 324 / 755
» The Expression Problem Revisited
Sort
View
FOSSACS
2007
Springer
16 years 28 days ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
GBRPR
2007
Springer
16 years 28 days ago
Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
Huiying Shen, James Coughlan
ICALP
2007
Springer
16 years 28 days ago
Minimum-Time Reachability in Timed Games
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
WADS
2007
Springer
121views Algorithms» more  WADS 2007»
16 years 27 days ago
Cauchy's Theorem and Edge Lengths of Convex Polyhedra
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
SAC
2006
ACM
16 years 22 days ago
Towards a model-driven join point model
Aspect–Oriented Programming (AOP) is increasingly being adopted by developers to better modularize object–oriented design by introducing crosscutting concerns. However, due to...
Walter Cazzola, Antonio Cicchetti, Alfonso Pierant...