Sciweavers

723 search results - page 137 / 145
» Computer Applications to Structural Analysis of Pavements
Sort
View
JACM
2007
160views more  JACM 2007»
13 years 7 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
TVCG
2008
148views more  TVCG 2008»
13 years 7 months ago
Globally Optimal Surface Mapping for Surfaces with Arbitrary Topology
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
Xin Li, Yunfan Bao, Xiaohu Guo, Miao Jin, Xianfeng...
SAC
2011
ACM
12 years 10 months ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
14 years 7 months ago
Indexing multi-dimensional time-series with support for multiple distance measures
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
Michail Vlachos, Marios Hadjieleftheriou, Dimitrio...
CSL
2007
Springer
14 years 1 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin