Sciweavers

7421 search results - page 1329 / 1485
» In search of dependable design
Sort
View
ICFP
2008
ACM
16 years 6 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
MOBISYS
2007
ACM
16 years 6 months ago
Context browsing with mobiles - when less is more
Except for a handful of "mobile" Web sites, the Web is designed for browsing with personal computers with large screens capable of fitting the content of most Web pages....
Yevgen Borodin, Jalal Mahmud, I. V. Ramakrishnan
WSDM
2010
ACM
166views Data Mining» more  WSDM 2010»
16 years 4 months ago
Ranking Mechanisms in Twitter-Like Forums
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
Anish Das Sarma, Atish Das Sarma, Sreenivas Gollap...
EUROSYS
2006
ACM
16 years 3 months ago
Database replication policies for dynamic content applications
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
Gokul Soundararajan, Cristiana Amza, Ashvin Goel
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
16 years 3 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
« Prev « First page 1329 / 1485 Last » Next »