Sciweavers

1819 search results - page 107 / 364
» Computability and Representations of the Zero Set
Sort
View
COR
2008
99views more  COR 2008»
14 years 10 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
ACL
2011
14 years 1 months ago
Discovering Sociolinguistic Associations with Structured Sparsity
We present a method to discover robust and interpretable sociolinguistic associations from raw geotagged text data. Using aggregate demographic statistics about the authors’ geo...
Jacob Eisenstein, Noah A. Smith, Eric P. Xing
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
HCCMeshes: Hierarchical-Culling oriented Compact Meshes
Hierarchical culling is a key acceleration technique used to efficiently handle massive models for ray tracing, collision detection, etc. To support such hierarchical culling, bo...
Tae-Joon Kim, Yongyoung Byun, Yongjin Kim, Bochang...
INFOCOM
2011
IEEE
14 years 1 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
CHI
1997
ACM
15 years 2 months ago
Overlaying Motion, Time and Distance in 3-Space
An innovative method for visually and functionally combining the elements of motion, time and distance in a three-dimensional computer animation is presented. At a glance, the ela...
Mike Pell