Sciweavers

163 search results - page 26 / 33
» Fast Edge-Routing for Large Graphs
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan
SIGMOD
2009
ACM
139views Database» more  SIGMOD 2009»
14 years 8 months ago
Vispedia: on-demand data integration for interactive visualization and exploration
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
Bryan Chan, Justin Talbot, Leslie Wu, Nathan Sakun...
ASYNC
2001
IEEE
136views Hardware» more  ASYNC 2001»
13 years 11 months ago
Efficient Exact Two-Level Hazard-Free Logic Minimization
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...
Chris J. Myers, Hans M. Jacobson
INFOCOM
2009
IEEE
14 years 2 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
INTERNET
2007
105views more  INTERNET 2007»
13 years 7 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao