Sciweavers

5022 search results - page 272 / 1005
» Data structures and problem solving using Java
Sort
View
114
Voted
CCCG
1993
15 years 4 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
149
Voted
JSAC
2007
155views more  JSAC 2007»
15 years 2 months ago
Semantic social overlay networks
— Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of netw...
Alexander Löser, Steffen Staab, Christoph Tem...
100
Voted
INCDM
2007
Springer
69views Data Mining» more  INCDM 2007»
15 years 9 months ago
Simultaneous Co-clustering and Modeling of Market Data
For difficult prediction problems, practitioners often segment the data into relatively homogenous groups and then build a model for each group. This two-step procedure usually res...
Meghana Deodhar, Joydeep Ghosh
113
Voted
MICCAI
2007
Springer
16 years 3 months ago
Interactive Contacts Resolution Using Smooth Surface Representation
Accurately describing interactions between medical devices and anatomical structures, or between anatomical structures themselves, is an essential step towards the adoption of comp...
Jérémie Dequidt, Julien Lenoir, Step...
134
Voted
DAC
1999
ACM
16 years 3 months ago
Synthesis of Embedded Software Using Free-Choice Petri Nets
Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained part...
Marco Sgroi, Luciano Lavagno