3598 search results - page 93 / 720 » New efficient algorithms for computing effective capacitance |
NPC
2004
Springer
15 years 3 months ago
2004
Springer
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
107
click to vote
EOR
2010
14 years 7 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Conventional mutual information (MI)-based registration using pixel intensities is time-consuming and ignores spatial information, which can lead to misalignment. We propose a met...
HPCC
2007
Springer
15 years 1 months ago
2007
Springer
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
CHI
2004
ACM
15 years 10 months ago
2004
ACM
Users of modern GUIs routinely engage in visual searches for various control items, such as buttons and icons. Because this is so ubiquitous, it is important that the visual prope...