Sciweavers

16404 search results - page 3147 / 3281
» A set coverage problem
Sort
View
124
Voted
UIST
2004
ACM
15 years 9 months ago
Hierarchical parsing and recognition of hand-sketched diagrams
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
Levent Burak Kara, Thomas F. Stahovich
137
Voted
ASIAN
2004
Springer
150views Algorithms» more  ASIAN 2004»
15 years 9 months ago
Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Vijay A. Saraswat
CIKM
2004
Springer
15 years 9 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
EMSOFT
2004
Springer
15 years 9 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
143
Voted
ESORICS
2004
Springer
15 years 9 months ago
Discovering Novel Attack Strategies from INFOSEC Alerts
Abstract. Correlating security alerts and discovering attack strategies are important and challenging tasks for security analysts. Recently, there have been several proposed techni...
Xinzhou Qin, Wenke Lee
« Prev « First page 3147 / 3281 Last » Next »