Sciweavers

942 search results - page 187 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
WWW
2004
ACM
14 years 10 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...
WWW
2010
ACM
14 years 4 months ago
Exploiting social context for review quality prediction
Online reviews in which users publish detailed commentary about their experiences and opinions with products, services, or events are extremely valuable to users who rely on them ...
Yue Lu, Panayiotis Tsaparas, Alexandros Ntoulas, L...
FOCS
2008
IEEE
14 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
INFOCOM
2008
IEEE
14 years 4 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
14 years 3 months ago
A robust detailed placement for mixed-size IC designs
— The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recen...
Jason Cong, Min Xie