Sciweavers

186 search results - page 22 / 38
» Speeding up algorithms on compressed web graphs
Sort
View
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
14 years 18 days ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
14 years 4 months ago
Reduction of Crosstalk Pessimism using Tendency Graph Approach
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
Murthy Palla, Klaus Koch, Jens Bargfrede, Manfred ...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
WWW
2007
ACM
14 years 8 months ago
Towards efficient dominant relationship exploration of the product items on the web
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
Zhenglu Yang, Lin Li, Botao Wang, Masaru Kitsurega...
ISPAN
1997
IEEE
13 years 11 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal