Sciweavers

592 search results - page 75 / 119
» Crossing numbers of random graphs
Sort
View
INFOVIS
2005
IEEE
14 years 1 months ago
Flow Map Layout
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
Doantam Phan, Ling Xiao, Ron B. Yeh, Pat Hanrahan,...
EUROSYS
2010
ACM
14 years 3 days ago
Locating cache performance bottlenecks using data profiling
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
Aleksey Pesterev, Nickolai Zeldovich, Robert T. Mo...
ICASSP
2011
IEEE
12 years 11 months ago
Spatially-correlated sensor discriminant analysis
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
Kush R. Varshney
COMAD
2009
13 years 9 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
CMOT
2004
141views more  CMOT 2004»
13 years 7 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander