Sciweavers

2065 search results - page 381 / 413
» Using Architectural Models at Runtime: Research Challenges
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
CIKM
2011
Springer
12 years 7 months ago
Learning to aggregate vertical results into web search results
Aggregated search is the task of integrating results from potentially multiple specialized search services, or verticals, into the Web search results. The task requires predicting...
Jaime Arguello, Fernando Diaz, Jamie Callan
ICPADS
2002
IEEE
14 years 18 days ago
Design and Analysis of a Fault-Tolerant Mechanism for a Server-Less Video-On-Demand System
Video-on-demand (VoD) systems have traditionally been built on the client-server architecture, where a video server stores, retrieves, and transmits video data to video clients fo...
Jack Y. B. Lee, Raymond W. T. Leung
GRC
2010
IEEE
13 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
ICCAD
2006
IEEE
177views Hardware» more  ICCAD 2006»
14 years 4 months ago
Application-specific customization of parameterized FPGA soft-core processors
Soft-core microprocessors mapped onto field-programmable gate arrays (FPGAs) represent an increasingly common embedded software implementation option. Modern FPGA soft-cores are p...
David Sheldon, Rakesh Kumar, Roman L. Lysecky, Fra...