9842 search results - page 1515 / 1969 » The Complexity of the Matching-Cut Problem |
197
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
199
click to vote
ICSE
2000
IEEE-ACM
15 years 10 months ago
2000
IEEE-ACM
We present Galileo, an innovative engineering modeling and analysis tool built using an approach we call packageoriented programming (POP). Galileo represents an ongoing evaluatio...
184
Voted
ICSE
2000
IEEE-ACM
15 years 10 months ago
2000
IEEE-ACM
Separation of concerns has been central to software engineering for decades, yet its many advantages are still not fully realized. A key reason is that traditional modularization ...
162
click to vote
MOBICOM
2000
ACM
15 years 10 months ago
2000
ACM
Compressing protocol headers has traditionally been an attractive way of conserving bandwidth over low-speed links, including those in wireless systems. However, despite the growt...
202
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...