Sciweavers

1165 search results - page 62 / 233
» Effective linear programming based placement methods
Sort
View
ATAL
2009
Springer
15 years 9 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
VISUALIZATION
2000
IEEE
15 years 6 months ago
New techniques for topologically correct surface reconstruction
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
Udo Adamy, Joachim Giesen, Matthias John
COLING
2008
15 years 3 months ago
Robust and Efficient Chinese Word Dependency Analysis with Linear Kernel Support Vector Machines
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
Yu-Chieh Wu, Jie-Chi Yang, Yue-Shi Lee
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 2 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
ICIP
2006
IEEE
16 years 4 months ago
Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction
Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve thos...
Chinh La, Minh N. Do