Sciweavers

1648 search results - page 257 / 330
» On the generation of bicliques of a graph
Sort
View
WWW
2004
ACM
14 years 9 months ago
Time-based contextualized-news browser (t-cnb)
We propose a new way of browsing contextualized-news articles. Our prototype browser system is called a Time-based ContextualizedNews Browser (T-CNB). The T-CNB concurrently and a...
Akiyo Nadamoto, Katsumi Tanaka
POPL
2009
ACM
14 years 9 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
PPOPP
2009
ACM
14 years 9 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining templates from search result records of search engines
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...
Hongkun Zhao, Weiyi Meng, Clement T. Yu
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
14 years 9 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul