Sciweavers

1487 search results - page 266 / 298
» The Computational Complexity of Link Building
Sort
View
CLOUD
2010
ACM
14 years 1 months ago
Stateful bulk processing for incremental analytics
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...
SIGGRAPH
1999
ACM
14 years 23 days ago
LCIS: A Boundary Hierarchy for Detail-Preserving Contrast Reduction
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
Jack Tumblin, Greg Turk
CACM
2000
120views more  CACM 2000»
13 years 8 months ago
Universal Usability
ost abstract sense, we build web pages so that computers can read them. The software that people use to access web pages is what "reads" the document. How the page is ren...
Ben Shneiderman
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 6 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ANCS
2008
ACM
13 years 10 months ago
Implementing an OpenFlow switch on the NetFPGA platform
We describe the implementation of an OpenFlow Switch on the NetFPGA platform. OpenFlow is a way to deploy experimental or new protocols in networks that carry production traffic. ...
Jad Naous, David Erickson, G. Adam Covington, Guid...