808 search results - page 139 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
114
Voted
JALC
2006
15 years 17 days ago
2006
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
106
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
112
Voted
CAD
2007
Springer
15 years 19 days ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
103
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
104
click to vote
WWW
2004
ACM
16 years 1 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...