Sciweavers

175 search results - page 28 / 35
» One Update for all Moving Objects at a Timestamp
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 1 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
COMPGEOM
2008
ACM
13 years 9 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
CE
2008
95views more  CE 2008»
13 years 7 months ago
Enabling teachers to explore grade patterns to identify individual needs and promote fairer student assessment
Exploring student test, homework, and other assessment scores is a challenge for most teachers, especially when attempting to identify cross-assessment weaknesses and produce fina...
Sorelle A. Friedler, Yee Lin Tan, Nir J. Peer, Ben...
DASFAA
2010
IEEE
419views Database» more  DASFAA 2010»
14 years 2 months ago
Incremental Clustering for Trajectories
Trajectory clustering has played a crucial role in data analysis since it reveals underlying trends of moving objects. Due to their sequential nature, trajectory data are often rec...
Zhenhui Li, Jae-Gil Lee, Xiaolei Li, Jiawei Han
APIN
2006
136views more  APIN 2006»
13 years 7 months ago
Cell modeling with reusable agent-based formalisms
Biologists are building increasingly complex models and simulations of cells and other biological entities, and are looking at alternatives to traditional representations. Making ...
Ken Webb, Tony White