Sciweavers

2304 search results - page 415 / 461
» On the Vulnerability of Large Graphs
Sort
View
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
MM
2005
ACM
140views Multimedia» more  MM 2005»
15 years 11 months ago
Web image clustering by consistent utilization of visual features and surrounding texts
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...
Bin Gao, Tie-Yan Liu, Tao Qin, Xin Zheng, QianShen...
PLDI
2004
ACM
15 years 11 months ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman
CP
2003
Springer
15 years 11 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
IEEEPACT
2002
IEEE
15 years 10 months ago
A Framework for Parallelizing Load/Stores on Embedded Processors
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
Xiaotong Zhuang, Santosh Pande, John S. Greenland ...