Sciweavers

405 search results - page 45 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
TCAD
2008
68views more  TCAD 2008»
14 years 11 months ago
Highly Efficient Gradient Computation for Density-Constrained Analytical Placement
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
Jason Cong, Guojie Luo, Eric Radke
193
Voted
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
16 years 13 days ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
DAC
2009
ACM
16 years 2 days ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
CSCLP
2005
Springer
15 years 4 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
ICDT
2003
ACM
91views Database» more  ICDT 2003»
15 years 4 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen