Sciweavers

949 search results - page 129 / 190
» Theory of Constraints
Sort
View
141
Voted
TVCG
2011
136views more  TVCG 2011»
14 years 7 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
POPL
2011
ACM
14 years 3 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
106
Voted
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 21 days ago
Optimizing away joins on data streams
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
Lukasz Golab, Theodore Johnson, Nick Koudas, Dives...
117
Voted
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
15 years 4 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 22 days ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick