Sciweavers

1399 search results - page 269 / 280
» Multi-party Finite Computations
Sort
View
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 7 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
TVCG
1998
127views more  TVCG 1998»
13 years 7 months ago
Dynamic Catmull-Clark Subdivision Surfaces
—Recursive subdivision schemes have been extensively used in computer graphics, computer-aided geometric design, and scientific visualization for modeling smooth surfaces of arbi...
Hong Qin, Chhandomay Mandal, Baba C. Vemuri
IPPS
2010
IEEE
13 years 5 months ago
Scalable multi-pipeline architecture for high performance multi-pattern string matching
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...
Weirong Jiang, Yi-Hua Edward Yang, Viktor K. Prasa...
WIOPT
2010
IEEE
13 years 5 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi
DLT
2009
13 years 5 months ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano