Sciweavers

11211 search results - page 1919 / 2243
» Rank-Sensitive Data Structures
Sort
View
PAKDD
2009
ACM
120views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Detecting Link Hijacking by Web Spammers.
Abstract. Since current search engines employ link-based ranking algorithms as an important tool to decide a ranking of sites, Web spammers are making a significant effort to man...
Masaru Kitsuregawa, Masashi Toyoda, Young-joo Chun...
SDM
2009
SIAM
223views Data Mining» more  SDM 2009»
16 years 1 months ago
Context Aware Trace Clustering: Towards Improving Process Mining Results.
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
16 years 22 days ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
PLPV
2010
ACM
16 years 22 days ago
Arity-generic datatype-generic programming
Some programs are doubly-generic. For example, map is datatypegeneric in that many different data structures support a mapping operation. A generic programming language like Gener...
Stephanie Weirich, Chris Casinghino
PADL
2010
Springer
16 years 22 days ago
An Ode to Arrows
Abstract. We study a number of embedded DSLs for autonomous ordinary differential equations (autonomous ODEs) in Haskell. A naive implementation based on the lazy tower of derivat...
Hai Liu, Paul Hudak
« Prev « First page 1919 / 2243 Last » Next »