Sciweavers

1629 search results - page 217 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
APWEB
2005
Springer
15 years 3 months ago
A Pattern Restore Method for Restoring Missing Patterns in Server Side Clickstream Data
Abstract. When analyzing patterns in server side data, it becomes quickly apparent that some of the data originating from the client is lost, mainly due to the caching of web pages...
I-Hsien Ting, Chris Kimble, Daniel Kudenko
CIBCB
2006
IEEE
15 years 4 months ago
A Novel Graphical Model Approach to Segmenting Cell Images
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
Shann-Ching Chen, Ting Zhao, Geoffrey J. Gordon, R...
WSDM
2012
ACM
325views Data Mining» more  WSDM 2012»
13 years 5 months ago
Correlating financial time series with micro-blogging activity
We study the problem of correlating micro-blogging activity with stock-market events, defined as changes in the price and traded volume of stocks. Specifically, we collect messa...
Eduardo J. Ruiz, Vagelis Hristidis, Carlos Castill...
ASPDAC
2010
ACM
163views Hardware» more  ASPDAC 2010»
14 years 8 months ago
A3MAP: architecture-aware analytic mapping for networks-on-chip
- In this paper, we propose a novel and global A3MAP (Architecture-Aware Analytic Mapping) algorithm applied to NoC (Networks-on-Chip) based MPSoC (Multi-Processor System-on-Chip) ...
Wooyoung Jang, David Z. Pan
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
14 years 11 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico