Sciweavers

1568 search results - page 264 / 314
» The problem of examination questions in algorithmics
Sort
View
147
Voted
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 8 months ago
A viewpoint-based approach for interaction graph analysis
Recent innovations have resulted in a plethora of social applications on the Web, such as blogs, social networks, and community photo and video sharing applications. Such applicat...
Sitaram Asur, Srinivasan Parthasarathy
PADS
1999
ACM
15 years 8 months ago
Exploiting Temporal Uncertainty in Parallel and Distributed Simulations
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
Richard Fujimoto
EH
1999
IEEE
179views Hardware» more  EH 1999»
15 years 8 months ago
Artificial Evolution of Active Filters: A Case Study
This article focuses on the application of artificial evolution to the synthesis of analog active filters. The main objective of this research is the achievement of a new class of...
Ricardo Salem Zebulum, Marco Aurélio Cavalc...
ICCAD
1998
IEEE
120views Hardware» more  ICCAD 1998»
15 years 8 months ago
Communication synthesis for distributed embedded systems
Designers of distributed embedded systems face many challenges in determining the appropriate tradeoffs to make when defining a system architecture or retargeting an existing desi...
Ross B. Ortega, Gaetano Borriello