Sciweavers

2412 search results - page 90 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
AOR
2006
95views more  AOR 2006»
15 years 3 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
ICALP
2007
Springer
15 years 9 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
EUROMICRO
2006
IEEE
15 years 6 months ago
A UML Profile and a Methodology for Real-Time Systems Design
Modern real-time systems are increasingly complex and pervasive. Model Driven Engineering (MDE) is the emerging approach for the design of complex systems, strongly the usage of a...
Cesare Bartolini, Antonia Bertolino, Guglielmo De ...
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 4 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
ISBI
2011
IEEE
14 years 6 months ago
Group sparsity based classification for cervigram segmentation
This paper presents an algorithm to classify pixels in uterine cervix images into two classes, namely normal and abnormal tissues, and simultaneously select relevant features, usi...
Yang Yu, Junzhou Huang, Shaoting Zhang, Christophe...